Author:
Öztop Hande,Tasgetiren M. Fatih,Kandiller Levent,Pan Quan-Ke
Subject
Management Science and Operations Research,Modeling and Simulation,General Computer Science
Reference72 articles.
1. Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times;Adiri;Nav. Res. Logist. Q.,1982
2. P. Baptiste and L. K. Hguny (1997), “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, pp. 429–438.
3. A note on a greedy heuristic for flow-shop makespan minimization with no machine idle-time;Baraz;Eur. J. Oper. Res.,2008
4. Benders decomposition for the mixed no-idle permutation flowshop scheduling problem;Bektaş;J. Sched.,2020
5. Automatic design of hyper-heuristic based on reinforcement learning;Choong;Inf. Sci. (Ny),2018
Cited by
19 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献