Common Due-Date Problem: Linear Algorithm for a Given Job Sequence

Abstract

This work presents a study on the general case of the Common Due-Date scheduling problem (CDD). The CDD is a problem of scheduling and sequencing a certain number of jobs with different processing times on a single machine against a common due-date. The objective of the problem is to minimize the total penalty incurred due to earliness or tardiness of the jobs. This work presents a novel property for the CDD which implies that in any given job sequence (also the optimal job sequence) of the CDD the position of the due-date is independent to the processing times of the jobs. Thereafter, we put forward an exact polynomial algorithm to optimize a given job sequence with a run-time complexity of O(n), where n is the number of jobs. Henceforth, we implement our polynomial algorithm in conjunction with a modified Simulated Annealing (SA) algorithm to obtain the optimal or best job sequence. The effectiveness of our approach is evident from our results for the benchmark instances provided in the OR-library.