Production sequencing problem with re-entrant work flows and sequence dependent setup times

International Journal of Production Research

Volumn 36, Issue 9, 1998, Pages 2435-2450

  Hwang, H ^a   Sun, J U ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; DECISION THEORY; DYNAMIC PROGRAMMING; GENETIC ALGORITHMS; PROBLEM SOLVING; PROCESS CONTROL; SCHEDULING;

RE-ENTRANT WORK FLOWS; SEQUENCE DEPENDENT SETUP TIMES;

PRODUCTION CONTROL;

EID: 0032163475     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/002075498192616     Document Type: Article

References (19)

1. Ahn, S. H., 1995, A study on an algorithm to minimize makespan of sequence-dependent jobs. Journal of the Korean Institute of Management Science, 12, 77-87.
2. Baker, K. R., 1974, Introduction to Sequencing and Scheduling (New York: Wiley).
3. Chen, C. L., Vempati, V. S. and Aljaber, N., 1995, An application of genetic algorithms for flow shop problems. European Journal of Operations Research, 80, 389-396.
4. 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.
5. 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.
6. Garey, M. R. and Johnson, D. S., 1979, Computers and Intractability: A Guide to the Theory of NP-Completeness (San Francisco, CA: Freeman).
7. Goldberg, D. E., 1989, Genetic Algorithms in Search, Optimization and Machine Learning (Reading, MA: Addison Wesley).
8. Golden, B. L. and Stewart, W. R., 1985, Empirical Analysis of Heuristics in the Traveling Salesman Problem (Chichester, UK: Wiley).
9. Gupta, J. N. D., 1986, The two machine sequence dependent flow shop scheduling problem. European Journal of Operations Research, 24, 439-446.
10. Gupta, S. K., 1982, N jobs and M machines job-shop problems with sequence dependent setup times. International Journal of Production Research, 20, 643-656.
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. Karg, L. L. and Thompson, G. L., 1964, A heuristic approach to the traveling salesman. Management Science, 11, 225-248.
13. 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.
14. 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 and Operations Research, 22, 857-869.
15. Lockett, A. G. and Muhlemann, A. P., 1972, A scheduling problem involving sequence dependent changeover times. Operations Research, 20, 895-902.
16. Rubin, P. A. and Ragatz, G. L., 1995, Scheduling in a sequence dependent setup environment with genetic search. Computers and Operations Research, 22, 85-99.
17. Uskup, E. and Smith, S. B., 1975, A branch-and-bound algorithm for two-stage productionsequencing problems. Operations Research, 23, 118-136.
18. White, C. H. and Wilson, R. C., 1977, Sequence dependent set-up times and job sequencing. International Journal of Production Research, 15, 191-202.
19. Yoshida, T. and Hitomi, K., 1979, Optimal two-stage production scheduling with setup times separated. AIIE Transactions, 11, 261-263.