An efficient algorithm for multi-hoist cyclic scheduling with fixed processing times

Operations Research Letters

Volumn 34, Issue 4, 2006, Pages 465-472

  Leung, Janny M Y ^a   Levner, Eugene ^b  

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

^b HOLON INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Cyclic schedules; Hoist scheduling; Partially ordered sets; PCB manufacturing; Polynomial algorithms

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; OPTIMIZATION; POLYNOMIALS; PRINTED CIRCUIT BOARDS; SCHEDULING;

CYCLIC SCHEDULES; HOIST-SCHEDULING; PARTIALLY-ORDERED SETS; PCB MANUFACTURING;

ALGORITHMS;

EID: 33646102212     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.orl.2005.07.010     Document Type: Article

References (18)

1. Aizenshtat V.S. Multioperator cyclic processes. Dokl. Acad. Nauk BSSR 7 4 (1963) 224-227 (in Russian)
2. Cameron P. Combinatorics: Topics, Techniques, Algorithms (1994), Cambridge University Press, Cambridge, England
3. Crama Y., Kats V., van de Klundert J., and Levner E. Cyclic scheduling in robotic flowshops. Ann. Oper. Res. 96 (2000) 97-124
4. Hall N.G., Kamoun H., and Sriskandarajah C. Scheduling in robotic cells: complexity and steady state analysis. European J. Oper. Res. 109 (1998) 43-65
5. U. Heinrichs, C. Moll, On the scheduling of one-dimensional transport systems, Technical Report ZPR97-277, Mathematisches Institut, Universität zu Köln, Germany, 1997.
6. Karzanov A.V., and Livshits E.M. Minimal quantity of operators for serving a homogeneous linear technological process. Automat. Remote Control 39 3 (1978) 445-450
7. Kats V., and Levner E. Minimizing the number of robots to meet a given cyclic schedule. Ann. Oper. Res. 69 (1997) 209-226
8. Kats V., and Levner E. Cyclic scheduling in a robotic production line. J. Scheduling 5 (2002) 23-41
9. Lee C.-Y., Lei L., and Pinedo M. Current trends in deterministic scheduling. Ann. Oper. Res. 70 (1997) 1-41
10. Lei L., Armstrong R., and Gu S. Minimizing the fleet size with dependent time-windows and single-track constraint. Oper. Res. Lett. 14 (1993) 91-98
11. Levner E., Kats V., and Levit V.E. An improved algorithm for cyclic flowshop scheduling in a robotic cell. European J. Oper. Res. 97 (1997) 500-508
12. Livshits E.M., Mikhailetsky Z.N., and Chervyakov E.V. A scheduling problem in an automated flow line with an automated operator. Comput. Math. Computerized Systems 5 (1974) 151-155 (in Russian)
13. R. Mak, Y. Wong, J.M.Y. Leung, K. Lam, S.M. Gupta, The hoist scheduling problem for no-wait production lines-a survey of research, Technical Report SEEM2000-05, Systems Engineering and Engineering Management Department, The Chinese University of Hong Kong, Hong Kong, 2000.
14. Mirsky L. A dual of Dilworth's decomposition theorem. Amer. Math. Monthly 78 (1971) 876-877
15. Orlin J.B. Minimizing the number of vehicles to meet a fixed periodic schedule: an applications of periodic posets. Oper. Res. 30 (1982) 760-776
16. Phillips L.W., and Unger P.S. Mathematical programming solution of a hoist scheduling program. AIIE Trans. 8 2 (1976) 219-225
17. Suprunenko D.A., Aizenshtat V.S., and Metel'skii A.S. A multistage technological process. Dokl. Acad. Nauk BSSR 6 9 (1962) 111-114 (in Russian)
18. van Lint J.H., and Wilson R.M. A Course in Combinatorics (1992), Cambridge University Press, Cambridge, England