A note on polynomially-solvable cases of common due date early-tardy scheduling with release dates

作者：Valente; Jorge M S; Alves; Rui A F S

来源：Investigaˋˋo Operacional, 2004.

• scheduling
• early-tardy
• common due date
• unit processing times
• release dates.

in this paper we consider the single machine scheduling problem with integer release dates and the objective of minimising the sum of deviations of jobs%26apos; completion times from a common integer due date. we present an efficient polynomial algorithm for the unit processing time case. we also show how to calculate in polynomial time the minimum non-restrictive due date for the general case.

• 出版日期2004