Mathematical programming formulations for machine scheduling: A survey

This publication has 29 references indexed in Scilit:

• Minimizing Total Tardiness on One Machine is NP-Hard
  Mathematics of Operations Research, 1990
• Parallel Machine Scheduling: Processing Rates Dependent on Number of Jobs in Operation
  Management Science, 1987
• Batching to Minimize Flow Times on One Machine
  Management Science, 1987
• Preemptive Scheduling of Uniform Machines by Ordinary Network Flow Techniques
  Management Science, 1986
• Preemptive Scheduling of a Single Machine to Minimize Maximum Cost Subject to Release Dates and Precedence Constraints
  Operations Research, 1983
• Surrogate duality relaxation for job shop scheduling
  Discrete Applied Mathematics, 1983
• Scheduling subject to resource constraints: classification and complexity
  Discrete Applied Mathematics, 1983
• A dual algorithm for the one-machine scheduling problem
  Mathematical Programming, 1976
• Scheduling independent tasks to reduce mean finishing time
  Communications of the ACM, 1974
• Optimal Solution of Scheduling Problems Using Lagrange Multipliers: Part I
  Operations Research, 1973