In this note, we revisit two types of scheduling problem with weighted early/late work criteria and a common due date. For parallel identical machines environment, we present a dynamic programming approach running in pseudopolynomial time, to classify the considered problem into the set of binary NP-hard. We also propose an enumeration algorithm for comparison. For two-machine flow shop systems, we focus on a previous dynamic programming method, but with a more precise analysis, to improve the practical performance during its execution. For each model, we verify our studies through computational experiments, in which we show the advantages of our techniques, respectively.
A Note on Multimachine Scheduling with Weighted Early/Late Work Criteria and Common Due Date