Dynamic programming approach to the single-machine sequencing problem with different due-dates

DOI10.1016/0898-1221(90)90001-ZzbMath0699.90092OpenAlexW2083506849MaRDI QIDQ913669

Cheng, T. C. Edwin

Publication date: 1990

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(90)90001-z

zbMATH Keywords

NP-completejob completion timesdue-datessum of absolute deviations

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)

Cites Work

• Unnamed Item
• Unnamed Item
• Survey of scheduling research involving due date determination decisions
• The art and theory of dynamic programming
• A Dynamic Programming Approach to Sequencing Problems
• Minimizing the sum of absolute lateness in single-machine and multimachine scheduling
• Minimizing the average deviation of job completion times about a common due date
• Minimizing mean absolute deviation of completion times about a common due date
• Single- and multiple-processor models for minimizing completion time variance
• A Generalized Model of Optimal Due-Date Assignment by Linear Programming
• Minimizing the average deviation of job completion times about a common due-date: An extension
• One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties