Funder
Ford-University of Michigan Innovation Alliance
Subject
Information Systems and Management,Management Science and Operations Research,Strategy and Management
Reference27 articles.
1. Coffman EG, Jr., Garey MR, Johnson DS. Approximation algorithms for bin packing: a survey. In: Approximation algorithms for NP-hard problems. Boston, US: PWS Publishing Co.; 1996. p. 46–93.
2. A branch-and-price algorithm for the bin packing problem with conflicts;Elhedhli;INFORMS Journal on Computing,2011
3. A state-of-the-art review of parallel-machine scheduling research;Cheng;European Journal of Operational Research,1990
4. Fifty years of scheduling;Potts;Journal of the Operational Research Society,2009
5. A survey of scheduling problems with late work criteria;Sterna;Omega,2011
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献