Article ID: | iaor20021716 |
Country: | United States |
Volume: | 48 |
Issue: | 4 |
Start Page Number: | 293 |
End Page Number: | 298 |
Publication Date: | Jun 2001 |
Journal: | Naval Research Logistics |
Authors: | Epstein Sheldon, Wilamowsky Yonah, Dickman Bernard |
Common due date problems have been extensively discussed in the scheduling literature. Initially, these problems discussed finding a common due date for a set of jobs on a single machine. These single machine problems were later extended to finding the common due date on a set of parallel machines. This paper further extends the single machine problem to finding multiple common due dates on a single machine. For a basic and important class of penalty functions, we show that this problem is comparable to the parallel machine problem.