A local search algorithm for jobshop scheduling problems with alternative operations and sequence-dependent setups

Computers and Industrial Engineering

Volumn 42, Issue 1, 2002, Pages 43-58

  Choi, In Chan ^a   Choi, Dae Sik ^a  

^a Korea University   (South Korea)

Author keywords

Alternative operations; Jobshop; Mixed integer program; Scheduling; Sequence dependent set ups

Indexed keywords

ALGORITHMS; BENCHMARKING; COMPUTATIONAL COMPLEXITY; INTEGER PROGRAMMING; JOB ANALYSIS; MATHEMATICAL MODELS; SCHEDULING;

JOBSHOP SCHEDULING;

INDUSTRIAL ENGINEERING;

EID: 0036533228     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0360-8352(02)00002-5     Document Type: Article

References (22)

1. A scheduling approach for a flexible manufacturing system
2. The shifting bottleneck procedure for job shop scheduling
3. A review of scheduling research involving setup considerations
4. A computational study of the job shop scheduling problem
5. A production planning model for flexible manufacturing systems with setup cost consideration
6. A genetic algorithm based procedure for more realistic job shop scheduling problems
7. Job shop scheduling with separable sequence-dependent setups
8. A genetic algorithm for jobshop problem
9. N job and M machines job-shop problems with sequence-dependent set-up time
10. Job-shop scheduling using neural networks
11. Deterministic job-shop scheduling: Past, present and future
12. Mathematical programming for the scheduling problem with alternative process plans in FMS
13. FMS jobshop scheduling using Lagrangian relaxation method
14. Impact of sequence-dependent setup time on jobshop scheduling performance
15. Scheduling in a production environment with multiple process plans per job
16. Job shop scheduling with a genetic algorithm and machine learning
17. Job shop scheduling with alternative machines
18. Fast Taboo search algorithm for job shop problem
19. A neural network model for scheduling problems
20. Parallel taboo search techniques for the job-shop scheduling problem
21. Jobshop scheduling by simulated annealing