Mathematical programming formulations for machine scheduling: A survey
- 1 April 1991
- journal article
- review article
- Published by Elsevier BV in European Journal of Operational Research
- Vol. 51 (3), 283-300
- https://doi.org/10.1016/0377-2217(91)90304-e
Abstract
No abstract availableThis publication has 29 references indexed in Scilit:
- Minimizing Total Tardiness on One Machine is NP-HardMathematics of Operations Research, 1990
- Parallel Machine Scheduling: Processing Rates Dependent on Number of Jobs in OperationManagement Science, 1987
- Batching to Minimize Flow Times on One MachineManagement Science, 1987
- Preemptive Scheduling of Uniform Machines by Ordinary Network Flow TechniquesManagement Science, 1986
- Preemptive Scheduling of a Single Machine to Minimize Maximum Cost Subject to Release Dates and Precedence ConstraintsOperations Research, 1983
- Surrogate duality relaxation for job shop schedulingDiscrete Applied Mathematics, 1983
- Scheduling subject to resource constraints: classification and complexityDiscrete Applied Mathematics, 1983
- A dual algorithm for the one-machine scheduling problemMathematical Programming, 1976
- Scheduling independent tasks to reduce mean finishing timeCommunications of the ACM, 1974
- Optimal Solution of Scheduling Problems Using Lagrange Multipliers: Part IOperations Research, 1973