Author:
Companys Ramon,Mateo Manel
Subject
Management Science and Operations Research,Modeling and Simulation,General Computer Science
Reference41 articles.
1. Lawler EL, Lenstra JK, Rinnooy Kan AHG, Shmoys DB. Sequencing and scheduling: algorithms and complexity. In: Graves CG, Rinnooy Kan AHG, Zipkin P, editors. Handbooks in operations research and management science, vol. 4: Logistics of production and inventory. Amsterdam: North-Holland; 1993. p. 445–522.
2. Optimal two- and three-stage production schedules with setup time included;Johnson;Naval Research Logistics Quarterly,1954
3. The complexity of flow shop and job shop scheduling;Garey;Mathematics of Operations Research,1976
4. A branch and bound algorithm for the exact solution of three-machine scheduling problems;Lomnicki;Operational Research Quarterly,1965
5. Application of the branch-and-bound algorithm to some flow shop problems;Ignall;Operations Research,1965
Cited by
28 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献