Tackling Common Due Window Problem with a Two-Layered Approach
This work presents a polynomial algorithm to optimize any given job sequence for the Common Due-Window (CDW) Problem. The CDW problem comprises of scheduling and sequencing a set of jobs against a due-window to minimize the total weighted earliness/tardiness penalty. This due-window is defined by the left and right common due-dates. Jobs that finish before (after) the left (right) due-date are termed as early (tardy) jobs. We present an exact polynomial algorithm for optimally scheduling a given fixed job sequence for a single machine with the runtime complexity of O(n), where n is the number of jobs. The linear algorithm and a heuristic based on the V-shaped property are then incorporated with a modified Simulated Annealing (SA) algorithm to obtain the optimal/near-optimal solutions. We carry out computational experiments to demonstrate the utility of our approach over the benchmark instances and previous work on this problem.
- 1.Awasthi, A., Lässig, J., Kramer, O., Weise, O.: Common due-window problem: polynomial algorithms for a given processing sequence. In: IEEE Symposium on Computational Intelligence in Production and Logistics Systems (IEEE SSCI-CIPLS), pp. 32–39 (2014)Google Scholar