A “Pseudopolynomial” Algorithm for Sequencing Jobs to Minimize Total Tardiness

This publication has 9 references indexed in Scilit:

• Complexity of Machine Scheduling Problems
  Published by Elsevier ,1977
• Complexity Results for Multiprocessor Scheduling under Resource Constraints
  SIAM Journal on Computing, 1975
• Minimizing Total Costs in One-Machine Scheduling
  Operations Research, 1975
• On the Computational Complexity of Combinatorial Problems
  Networks, 1975
• 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
• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
  Management Science, 1968
• A Dynamic Programming Approach to Sequencing Problems
  Journal of the Society for Industrial and Applied Mathematics, 1962
• Various optimizers for single‐stage production
  Naval Research Logistics Quarterly, 1956