One-operator-two-machine flowshop scheduling with setup and dismounting times

Computers and Operations Research

Volumn 26, Issue 7, 1999, Pages 715-730

  Cheng, T C Edwin ^a   Wang, Guoqing ^b   Sriskandarajah, Chelliah ^c  

^a HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

^b JINAN UNIVERSITY   (China)

^c UNIVERSITY OF TORONTO   (Canada)

Author keywords

Algorithms; Complexity; Flowshop scheduling; One operator two machine

Indexed keywords

BOUNDARY VALUE PROBLEMS; COMPUTATIONAL COMPLEXITY; ERROR ANALYSIS; HEURISTIC METHODS;

FLOWSHOP SCHEDULING;

SCHEDULING;

ALGORITHM; METHODOLOGY;

EID: 0032789050     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(98)00087-2     Document Type: Article

References (19)

1. Cheng TCE, Podolsky S. Just-in-time Manufacturing: An Introduction, 2/e. London: Chapman & Hall, 1996.
2. Krajeswski LJ, Ritzman LP. Operations Management: Strategy and Analysis. Reading, MA: Addison-Wesley, 1987.
3. East N. A Human Guide to Robots. UK: Alpin Press, 1983.
4. Su Q, Chen FE. Optimal sequencing of double-gripper gantry robot moves in tightly-coupled serial production systems. IEEE Transactions on Robotics and Automation 1996;12:22-30.
5. Graham RL, Lawler EL, Lenstra JK, Rinnooy Kan AHG. Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics 1979;5:287-326.
6. Dudek RA, Panwalker SS, Smith ML. The lessons of flowshop scheduling research. Operations Research 1992;40:7-13.
7. Lawler EL, Lenstra JK, Rinnooy Kan AHG, Shmoys DB. Sequencing and scheduling: Algorithms and complexity. In: Nemhauser GL, Rinnooy Kan AHG (editors), Logistics of Production and Inventory. Amsterdam: North-Holland, 1993.
8. Hall NG, Sriskandarajah C. A survey of machine scheduling problems with blocking and no-wait in process. Operations Ressearch 1996;44:510-24.
9. Crama Y, van de Klundert J. Cyclic scheduling of identical parts in a robotic cell. Operations Research 1997;45:952-6.
10. Levner E, Kats V, Levit VE. An improved algorithm for the cyclic flowshop scheduling in a robotic cell. European Journal of Operational Research 1997;97:500-8.
11. Kise H, Shioyama T, Ibaraki T. Automated two-machine flowshop scheduling: A solvable case. IIE Transactions 1991;23:10-6.
12. Sethi SP, Sriskandarajah C, Sorger G, Blazewicz J, Kubiak W. Sequencing of parts and robot moves in a robotic cell. International Journal of Flexible Manufacturing Systems 1992;4:331-58.
13. Hall NG, Kamoun H, Sriskandarajah C. Scheduling in robotic cells: Classification, two and three machine cells. Operations Research 1997;45:421-39.
14. Hall NG, Kamoun H, Sriskandarajah C. Scheduling in robotic cells: Complexity and steady state analysis. European Journal of Operational Research 1998;109:43-65.
15. Levner E, Kogan K, Maimon O. Flowshop scheduling of robotic cells with job-dependent transportation and set-up effects. Journal of the Operational Research Society 1995;46:1447-55.
16. Agnetis A, Pacciarelli D, Rossi F. Lot scheduling in a two-machine cell with swapping devices. IIE Transactions 1996;28:911-7.
17. Rock H. The three-machine no-wait flowshop problem is NP-complete. Journal of the Association for Computing Machinery 1984;33:336-45.
18. Gilmore PC, Gomory RE. Sequencing a one-state variable machine: A solvable case of the traveling salesman problem. Operations Research 1964;12:655-79.
19. Papadimitriou CH, Kanellakis PC. Flowshop scheduling with limited temporary storage. Journal of the Association for Computing Machinery 1980;27:533-49.