A polynomial algorithm for the two machine job-shop scheduling problem with a fixed number of jobs
- 1 March 1994
- journal article
- Published by Springer Science and Business Media LLC in OR Spectrum
- Vol. 16 (1), 5-7
- https://doi.org/10.1007/bf01719698
Abstract
No abstract availableKeywords
This publication has 1 reference indexed in Scilit:
- The complexity of shop-scheduling problems with two or three jobsEuropean Journal of Operational Research, 1991