Author:
Manier Marie-Ange,Lamrous Sid
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Modeling and Simulation
Reference16 articles.
1. Lei, L., Wang, T.-J.: A proof: the cyclic hoist scheduling problem is NP-complete. Working paper no. 89-16, Rutgers University (1989)
2. Manier, M.-A., Bloch, C.: A classification for hoist scheduling problems. Int. J. Flex. Manuf. Syst. 15(1), 37–55 (2003)
3. Grunder, O., Baptiste, P., Chappe, D.: The relationship between the physical layout of the work stations and the productivity of a saturated single-hoist production line. Int. J. Prod. Res. 35(8), 2189–2211 (1997)
4. Lei, L., Wang, T.-J.: The minimum common cycle algorithm for cycle scheduling of two material handling hoists with time window constraints. Manage. Sci. 37(12), 1629–1639 (1991)
5. Armstrong, R., Gu, S., Lei, L.: A greedy algorithm to determine the number of transporters in a cyclic electroplating process. IIE Trans. 28(5), 347–355 (1996)
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献