Multihoist cyclic scheduling with fixed processing and transfer times

IEEE Transactions on Automation Science and Engineering

Volumn 4, Issue 3, 2007, Pages 435-450

  Jiang, Yun ^a   Liu, Jiyin ^b  

^a BILKENT UNIVERSITY   (Turkey)

^b LOUGHBOROUGH UNIVERSITY   (United Kingdom)

Author keywords

Hoist scheduling; Multiple hoists; No wait; Optimization

Indexed keywords

CONSTRAINT THEORY; HOISTS; OPERATIONS RESEARCH; OPTIMIZATION; PROCESS CONTROL; SCHEDULING;

CYCLE LENGTH; CYCLIC SCHEDULING; HOIST SCHEDULING; MULTIPLE HOISTS;

RESOURCE ALLOCATION;

EID: 34547486089     PISSN: 15455955     EISSN: None     Source Type: Journal    
DOI: 10.1109/TASE.2006.884057     Document Type: Article

References (23)

1. L. Lei and T. J. Wang, "A proof: The cyclic hoist scheduling problem is NP-complete," in Working Paper 89-0016. Piscataway, NJ: Rutgers Univ., 1989.
2. L. W. Phillips and P. S. Unger, "Mathematical programming solution of a hoist scheduling program," AIIE Trans., vol. 28, pp. 219-225, 1976.
3. W. Song, Z. B. Zabinsky, and R. L. Storch, "An algorithm for scheduling a chemical processing tank line," Prod. Planning Control, vol. 4, pp. 323-332, 1993.
4. J. Liu, Y. Jiang, and Z. Zhou, "Cyclic scheduling of a single hoist in extended electroplating lines: A comprehensive integer programming solution," IIE Trans., vol. 34, pp. 905-914, 2002.
5. R. Armstrong, L. Lei, and S. Gu, "A bounding scheme for deriving the minimal cycle time of a single-transporter n-stage process with time-window constraints," Eur. J. Oper. Res., vol. 78, pp. 130-140, 1994.
6. L. Lei and T. J. Wang, "Determining optimal cyclic hoist schedules in a single-hoist electroplating line," IIE Trans., vol. 26, pp. 25-33, 1994.
7. W. C. Ng, "A branch and bound algorithm for hoist scheduling of a circuit board production line," Int. J, Flexible Manuf. Syst., vol. 8, pp. 45-65, 1996.
8. H. Chen, C. Chu, and J. M. Proth, "Cyclic scheduling of a hoist with time window constraints," IEEE Trans. Robot. Autom., vol. 14, no. 1, pp. 144-152, Feb. 1998.
9. L. Lei, "Determining the optimal starting time in a cyclic schedule with a given route," Comput. Oper. Res., vol. 20, pp. 807-816, 1993.
10. V. Kats and E. Levner, "A strongly polynomial algorithm for no-wait cyclic robotic flowshop scheduling," Oper. Res. Lett., vol. 21, pp. 171-179, 1997.
11. Y. Crama, V. Kats, V. Van de Klundert, and E. Levner, "Cyclic scheduling in robotic flowshops,"Ann. Oper. Res., vol. 96, pp. 97-124, 2000.
12. P. Serafini and W. Ukowich, "A mathematical model for periodic scheduling problems," SIAM J. Discrete Math., vol. 2, pp. 550-581, 1989.
13. L. Lei and T. J. Wang, "The minimum common-cycle algorithm for cyclic scheduling of two material handling hoists with time window constraints," Manage. Sci., vol. 37, pp. 1629-1639, 1991.
14. A. Che and C. Chu, "Multi-degree cyclic scheduling of two robots in a no-wait flowshop," IEEE Trans. Autom. Sci. Eng., vol. 2, no. 2, pp. 173-183, Apr. 2005.
15. L. Lei, R. Armstrong, and S. Gu, "Minimizing the fleet size with dependent time-window and single-track constraints," Oper. Res. Lett., vol. 14, pp. 91-98, 1993.
16. R. Armstrong, S. Gu, and L.Lei, "A greedy algorithm to determine the number of transporters in a cyclic electroplating process," IIE Trans., vol. 28, pp. 347-355, 1996.
17. J. B. Orlin, "Minimizing the number of vehicles to meet a fixed periodic schedule," Oper. Res., vol. 30, pp. 760-776, 1982.
18. V. Kats and E. Levner, "Minimizing the number of robots to meet a given cyclic schedule," Ann. Oper. Res., vol. 69, pp. 209-226, 1997.
19. J. Liu and Y. Jiang, "An efficient optimal solution to the two-hoist no-wait cyclic scheduling problem," Oper. Res., vol. 53, pp. 313-327, 2005.
20. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, 2nd ed. Cambridge, MA: MIT Press, 2001.
21. R. Bellman, "On a routing problem," Quarterly of Applied Mathematics, vol. 16, pp. 87-90, 1958.
22. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network Flows: Theory, Algorithms, and Applications. Upper Saddle River, NJ: Prentice-Hall, 1993.
23. V. Kats and E. Levner, "Polynomial algorithms for scheduling of robots," in Intelligent Scheduling of Robots and FMS, E. Levner, Ed. Holon, Israel: CTEH, 1996, pp. 77-100.