Article ID: | iaor201422 |
Volume: | 65 |
Issue: | 2 |
Start Page Number: | 291 |
End Page Number: | 301 |
Publication Date: | Feb 2014 |
Journal: | Journal of the Operational Research Society |
Authors: | Liu J, Wang Y, Min X |
Keywords: | job shop, time windows |
In this paper, we consider a single‐machine common due‐window assignment scheduling problem with deteriorating jobs. Jobs’ processing times are defined by function of their starting times and job‐dependent deterioration rates that are related to jobs and are not all equal. The objective is to determine an optimal combination of sequence and common due‐window location so as to minimize the weighted sum of earliness, tardiness and due‐window location penalties. We propose an O(n2 log n) time algorithm to solve the problem and discuss several instances to illustrate it.