Subject
Information Systems and Management,Management Science and Operations Research,Strategy and Management
Reference56 articles.
1. Flowshop no-idle or no-wait scheduling to minimize the sum of completion times;Adiri;Naval Research Logistics,1982
2. Introduction to sequencing and scheduling;Baker,1974
3. Baptiste P, Hguny LK. A branch and bound algorithm for the F/no−idle/Cmax. In: Proceedings of the international conference on industrial engineering and production management, IEPM'97, vol. 1. Lyon, France; 1997. p. 429–38.
4. A note on a greedy heuristic for flow-shop makespan minimization with no machine idle-time;Baraz;European Journal of Operational Research,2008
5. A hybrid discrete differential evolution algorithm for the no-idle permutation flow shop scheduling problem with makespan criterion;Deng;Computers and Operations Research,2012
Cited by
145 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献