Scheduling problem in a two-machine flow line with the N-step prior-job-dependent set-up times

International Journal of Systems Science

Volumn 32, Issue 3, 2001, Pages 375-385

  Sun, Ji Ung ^a   Hwang, Hark ^b  

^a LG CNS Co Ltd   (South Korea)

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

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; DYNAMIC PROGRAMMING; GENETIC ALGORITHMS; PROBLEM SOLVING;

MACHINE FLOW LINE; SHOP SCHEDULING PROBLEM;

SCHEDULING;

EID: 0035296736     PISSN: 00207721     EISSN: None     Source Type: Journal    
DOI: 10.1080/002077201300029764     Document Type: Article

References (23)

1. Asano, M., and Ohta, H., 1999, Scheduling with shutdowns and sequence dependent set-up times. International Journal of Production Research, 37, 1661-1676.
2. Baker, K. R., 1974, Introduction to Sequencing and Scheduling (New York: Wiley).
3. Bellman, R., Esogbue, A. O., and Nabeshima, I., 1982, Mathematical Aspects of Scheduling and Applications (Oxford: Pergamon).
4. Bianco, L., Dell'Olmo, P., and Giordani, S., 1999, Flow shop no-wait scheduling with sequence dependent set-up times and release dates. INFOR Journal, 37, 3-11.
5. Chen, C. L., Vempati V. S., and Aljaber, N., 1995, An application of genetic algorithms for flow shop problems. European Journal of Operational Research, 80, 389-396.
6. Cheng, R., Gen M., and Tsujimura, Y., 1996, A tutorial survey of job-shop scheduling problems using genetic algorithms-I. Representation. Computers and Industrial Engineering, 30, 983-1996.
7. Corwin, B. D., and Esogbue, A. O., 1974, Two machine flow shop scheduling problems with sequence dependent setup times: a dynamic programming approach. Naval Research Logistics Quarterly, 21, 515-524.
8. Goldberg, D. E., 1989, Genetic Algorithms in Search, Optimization and Machine Learning (Reading, Massachusetts: Addison Wesley).
9. Goldberg, D. E., and Lingle, R. L., 1985, Loci and the traveling salesman problem. Proceedings of the First International Conference of Genetic Algorithms and Their Applications, Lawrence Erlbaum Associates, 1985, pp. 154-159.
10. Gupta, J. N. D., 1986, The two machine sequence dependent flow shop scheduling problem. European Journal of Operational Research, 24, 439-446.
11. Held, M., and Karp, R. M., 1962, A dynamic programming approach to sequencing problems. Journal of the Society of Industrial and Applied Mathematics. 10, 196-210.
12. Holland, J., 1975, Adaptation in Natural and Artificial Systems (University of Michigan Press).
13. Hwang, H., and Sun, J. U., 1998, Production sequencing problem with re-entrant work flows and sequence dependent setup times. International Journal of Production Research, 36, 2435-2450.
14. Johnson, S. M., 1954, Optimal two and three-stage production schedules with set-up times included. Naval Research Logistics Quarterly, 1, 61-68.
15. Kim, S. C., and Bobrowski, P. M., 1994, Impact of sequence-dependent setup time on job shop scheduling performance. International Journal of Production Research, 32, 1503-1520.
16. Lee, C. Y., and Choi, J. Y., 1995, A genetic algorithm for job sequencing problems with distinct due dates and general early-tardy penalty weights. Computers Operations Research, 22, 857-869.
17. Oliver, I. M., Smith, D. J., and Holland, J. R. C., 1987, A study of permutation crossover operators on the traveling salesman problem. Proceedings of the Second International Conference of Genetic Algorithms and their Applications, Lawrence Erlbaum Associates, 1987, pp. 224-230.
18. Ovacik, I. M., and Uzsoy, R., 1995, Rolling horizon procedures for dynamic parallel machine scheduling with sequence-dependent set-up times. International Journal of Production Research, 33, 3173-3192.
19. Poon, P. W., and Carter, J. N., 1995, Genetic algorithms crossover operators for ordering applications. Computers Operations Research, 22, 135-147.
20. Rubin, P. A., and Ragatz, G. L., 1995, Scheduling in a sequence dependent setup environment with genetic search. Computers Operations Research, 22, 85-99.
21. Sun, X., Noble, J. S., and Klein, C. M., 1999, Single-machine scheduling with sequence dependent setup to minimize total weighted squared tardiness. IIE Transactions, 31, 113-124.
22. Syswerda, G., 1991, Schedule optimization using genetic algorithms. A Handbook of Genetic Algorithms (New York: Van Nostrand Reinhold), pp. 332-349.
23. Uskup, E., and Smith, S. B., 1975, A branch-and-bound algorithm for two-stage production-sequencing problems. Operations Research, 23, 118-136.