Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the ‘tower of sets’ property
- 1 July 1994
- journal article
- Published by Elsevier BV in Mathematical and Computer Modelling
- Vol. 20 (2), 91-106
- https://doi.org/10.1016/0895-7177(94)90209-7
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobsAnnals of Operations Research, 1990
- A Solvable Case of the One-Machine Scheduling Problem with Ready and Due TimesOperations Research, 1978
- A Functional Equation and its Application to Resource Allocation and Sequencing ProblemsManagement Science, 1969
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late JobsManagement Science, 1968