On the complexity of generalized due date scheduling problems
- 6 March 1991
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 51 (1) , 100-109
- https://doi.org/10.1016/0377-2217(91)90149-p
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- Scheduling Problems With Generalized Due DatesIIE Transactions, 1986
- Loading and control policies for a flexible manufacturing systemInternational Journal of Production Research, 1981
- Complexity results for scheduling chains on a single machineEuropean Journal of Operational Research, 1980
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a SurveyPublished by Elsevier ,1979
- On Preemptive Scheduling of Unrelated Parallel Processors by Linear ProgrammingJournal of the ACM, 1978
- Complexity of Machine Scheduling ProblemsPublished by Elsevier ,1977
- A “Pseudopolynomial” Algorithm for Sequencing Jobs to Minimize Total TardinessPublished by Elsevier ,1977
- Open Shop Scheduling to Minimize Finish TimeJournal of the ACM, 1976
- Some simple scheduling algorithmsNaval Research Logistics Quarterly, 1974
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time EnvironmentJournal of the ACM, 1973