Job shop scheduling with sequence dependent setup times to minimize makespan

International Journal of Industrial Engineering : Theory Applications and Practice

Volumn 10, Issue 4, 2003, Pages 455-461

  Sun, J U ^a   Yee, S R ^a   Hwang, H ^b  

^a Hankuk University of Foreign Studies   (South Korea)

^b Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

Author keywords

Disjunctive graph; Genetic algorithm; Job shop scheduling; Sequence dependent setup

Indexed keywords

FLEXIBLE MANUFACTURING SYSTEMS; GENETIC ALGORITHMS; GRAPH THEORY; HEURISTIC PROGRAMMING; MACHINERY; OPTIMIZATION; PRODUCTIVITY;

DISJUNCTIVE GRAPH; JOB SHOP SCHEDULING; MAKESPAN; SEQUENCE DEPENDENT SETUP TIMES;

SCHEDULING;

EID: 1942518426     PISSN: 10724761     EISSN: 1943670X     Source Type: Journal    
DOI: None     Document Type: Article

References (9)

1. Adams, J., Balas, E. and Zawack, D., (1988). The shifting bottleneck procedure for job shop scheduling. Management Science, 3: 391-401.
2. Artigues, C. and Roubellat, F., (2002). An efficient algorithm for operation insertion in a multi-resource job-shop schedule with sequence-dependent setup times. Production Planning and Control, 13:.175-186.
3. Baker, K. R., (1974). Introduction to sequencing and scheduling. Wiley, New York.
4. Balas, E. (1969). Machine sequencing via disjunctive graphs: an implicit enumeration approach. Operations Research, 17: 941-957.
5. Cheng, R., Gen, M. and Tsujimura, Y., (1999). A tutorial survey of job-shop scheduling problems using genetic algorithms part II: hybrid genetic search strategies. Computers and Industrial Engineering, 36: 343-364.
6. Chu, C., Proth, J. M. and Wang C., (1998). Improving job-shop schedules through critical pairwise exchanges. International Journal of Production Research, 36: 683-694.
7. Goldberg, D. E., (1989). Genetic Algorithms in Search, Optimization and Machine Learning. Reading, Massachusetts: Addison Wesley.
8. Gupta, J. N. D., (2002). An excursion in scheduling theory: an overview of scheduling research in the twentieth century. Production Planning and Control, 13: 105-116.
9. Ovacik, I. M. and Uzsoy, R., (1997). Decomposition Methods for Complex Factory Scheduling Problems. Norwell, MA: Kluwer Academic.