Article ID: | iaor201110546 |
Volume: | 135 |
Issue: | 1 |
Start Page Number: | 154 |
End Page Number: | 161 |
Publication Date: | Jan 2012 |
Journal: | International Journal of Production Economics |
Authors: | Yang Dar-Li, Cheng T C E, Yang Suh-Jenq |
Keywords: | combinatorial optimization |
Due‐window assignment and production scheduling are important issues in operations management. In this study we investigate the problem of common due‐window assignment and scheduling of deteriorating jobs and a maintenance activity simultaneously on a single‐machine. We assume that the maintenance duration depends on its starting time. We provide polynomial time solutions for the problem and some of its special cases, where the objective is to simultaneously minimize the earliness, tardiness, due‐window starting time, and due‐window size costs.