Author:
Ruiz Rubén,Vallada Eva,Fernández-Martínez Carlos
Publisher
Springer Berlin Heidelberg
Reference62 articles.
1. Adiri, I., Pohoryles, D.: Flowshop no-idle or no-wait scheduling to minimize the sum of completion times. Naval Research Logistics 29(3), 495–504 (1982)
2. Baker, K.R.: Introduction to Sequencing and Scheduling. John Wiley & Sons, New York (1974)
3. Baptiste, P., Hguny, L.K.: A branch and bound algorithm for the F/no − idle/C max . In: Proceedings of the International Conference on Industrial Engineering and Production Management, IEPM 1997, Lyon, France, vol. 1, pp. 429–438 (1997)
4. Baraz, D., Mosheiov, G.: A note on a greedy heuristic for flow-shop makespan minimization with no machine idle-time. European Journal of Operational Research 184(2), 810–813 (2008)
5. Campbell, H.G., Dudek, R.A., Smith, M.L.: A heuristic algorithm for the n- job, m- machine sequencing problem. Management Science 16(10), 630–637 (1970)
Cited by
20 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献