The complexity of shop-scheduling problems with two or three jobs
- 15 August 1991
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 53 (3) , 326-336
- https://doi.org/10.1016/0377-2217(91)90066-5
Abstract
No abstract availableThis publication has 5 references indexed in Scilit:
- An efficient algorithm for the job-shop problem with two jobsComputing, 1988
- Complexity of Machine Scheduling ProblemsPublished by Elsevier ,1977
- Open Shop Scheduling to Minimize Finish TimeJournal of the ACM, 1976
- A Geometric Model and a Graphical Algorithm for a Sequencing ProblemOperations Research, 1963
- Solution of the Akers-Friedman Scheduling ProblemOperations Research, 1960