Article
Multiple Common Due Dates
Naval Research Logistics
(2001)
Abstract
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.
Disciplines
Publication Date
June, 2001
DOI
10.1002/nav.9
Citation Information
Bernard Dickman, Yonah Wilamowsky and Sheldon Epstein. "Multiple Common Due Dates" Naval Research Logistics Vol. 48 Iss. 4 (2001) p. 293 - 298 ISSN: 1520-6750 Available at: http://works.bepress.com/yonah-wilamowsky/7/