Scheduling of a single machine to minimize total weighted completion time subject to release dates

This publication has 9 references indexed in Scilit:

• A dual algorithm for the one-machine scheduling problem
  Mathematical Programming, 1976
• Minimizing Total Costs in One-Machine Scheduling
  Operations Research, 1975
• On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness
  Operations Research, 1975
• Sequencing with due‐dates and early start times to minimize maximum tardiness
  Naval Research Logistics Quarterly, 1974
• On sequencing with earliest starts and due dates with application to computing bounds for the (n/m/G/F_max) problem
  Naval Research Logistics Quarterly, 1973
• On the N-Job One-Machine, Sequence-Independent Scheduling Problem with Tardiness Penalties: A Branch-Bound Solution
  Management Science, 1972
• A hybrid algorithm for the one machine sequencing problem to minimize total tardiness
  Naval Research Logistics Quarterly, 1971
• One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
  Operations Research, 1969
• Various optimizers for single‐stage production
  Naval Research Logistics Quarterly, 1956