Subject
Applied Mathematics,Modelling and Simulation
Reference16 articles.
1. NP-hardness of shop scheduling problems with three jobs;Sotskov;Discrete Applied Mathematics,1995
2. The complexity of flow shop and job-shop scheduling;Garey;Mathematics of Operations Research,1976
3. B. Roy, B. Sussmann, Les problemes d’ordonnancement avec constraints disjunctives. Technical report 9, SEMA, Note D.S., Paris, 1964.
4. Machine sequencing via disjunctive graphs: an implicit enumeration algorithm;Balas;Operations Research,1969
5. A method of solution for general machine-scheduling problems;Charlton;Operational Research Quarterly,1970
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献