Transfer batch scheduling for a two-stage flowshop with identical parallel machines at each stage

Omega

Volumn 25, Issue 5, 1997, Pages 547-555

  Kim, J S ^a   Kang, S H ^b   Lee, S M ^c  

^a Keimyung University   (South Korea)

^b Seoul National University   (South Korea)

^c UNIVERSITY OF NEBRASKA LINCOLN   (United States)

Author keywords

Makespan; Transfer batch scheduling; Two stage flexible flowshop

Indexed keywords

SCHEDULING ALGORITHMS;

BATCH-SCHEDULING; FLEXIBLE FLOWSHOP; FLOW-SHOPS; IDENTICAL PARALLEL MACHINES; MAKESPAN; SCHEDULING METHODS; SCHEDULING PROBLEM; TRANSFER BATCH SCHEDULING; TRANSFER BATCHES; TWO-STAGE FLEXIBLE FLOWSHOP;

NUMERICAL METHODS;

EID: 0031258498     PISSN: 03050483     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0483(97)00015-7     Document Type: Article

References (17)

1. Johnson, S. M., Optimal two- and three-stage production schedules with setup times included. Naval Research Logistics Quarterly, 1954, 1, 61-68.
2. Mitten, L. G., Sequencing n jobs on two machines with arbitrary time lags. Management Science, 1959, 5, 293-298.
3. Yoshida, T. and Hitomi, K., Optimal two-stage production scheduling with setup times separated. AIIE Transactions, 1979, 11, 261-263.
4. Sule, D. R. and Huang, K. Y., Sequency on two and three machines with setup, processing and removal times separated. International Journal of Production Research, 1983, 21, 723-732.
5. Baker, K. R., Lot streaming in the two-machine flow shop with setup times. Annals of Operations Research, 1995, 57, 1-11.
6. Cetinkaya, F. C. and Kayaligil, M. S., Unit sized transfer batch scheduling with setup times. Computers and Industrial Engineering, 1992, 22, 177-183.
7. Kim, J. S., A study on scheduling problems for flexible flow lines, Ph.D. Thesis, Seoul National University, Korea, 1993.
8. Vickson, R. G. and Alfredsson, B. E., Two- and three-machine flow shop scheduling problems with equal sized transfer batches. International Journal of Production Research, 1992, 30, 1551-1574.
9. Guinet, A., Solomon, M. M., Kedia, P. K. and Dussauchoy, A., A computational study of heuristics for two-stage flexible flowshops. International Journal of Production Research, 1996, 34, 1399-1415.
10. Trietsch, D. and Baker, K. R., Basic techniques for lot streaming. Operations Research, 1993, 41, 1065-1076.
11. Szendrovits, A. Z., Note on the optimality of sub-batch sizes for a multi-stage EPQ model-A Rejoinder. Management Science, 1976, 23, 334-338.
12. Rajendran, C. and Chaudhuri, D., Scheduling in ann-job, m-stage flowshop with parallel processors to minimize makespan. International Journal of Production Economics, 1992, 27, 137-143.
13. Rajendran, C. and Chaudhuri, D., A multi-stage parallel processors flowshop problem with minimum flowtime. European Journal of Operational Research, 1992, 57, 111-122.
14. Sriskandarajah, C. and Ladet, P., Some no-wait shops scheduling problems: complexity concept. European Journal of Operational Research, 1986, 24, 424-438.
15. Sriskandarajah, C. and Sethi, S. P., Scheduling algorithms for flexible flowshops: worst and average case performance. European Journal of Operational Research, 1989, 43, 143-160.
16. Wittrock, R. J., Scheduling algorithms for flexible flow lines. IBM Journal of Research and Development, 1985, 29, 401-412.
17. Wittrock, R. J., An adaptable scheduling algorithm for flexible flowlines. Operations Research, 1988, 36, 445-453.