On the Complexity of Generalized Due Date Scheduling Problems

European Journal of Operational Research, Vol. 51, No. 1, pp. 100-109, March 1991

10 Pages Posted: 8 Apr 2008 Last revised: 25 May 2017

See all articles by Nicholas G. Hall

Nicholas G. Hall

Ohio State University (OSU) - Department of Management Sciences

Suresh Sethi

University of Texas at Dallas - Naveen Jindal School of Management

Chelliah Sriskandarajah

Texas A&M University

Date Written: 1991

Abstract

We study the recently identified class of generalized due date scheduling problems. These are machine scheduling problems for which due dates are specified according to the position in which a job is completed, rather than the identity of that job. Flexible manufacturing environments and public sector planning problems provide applications. We study a wide variety of these problems, with a view to determining their computational complexity. In several instances a problem which is NP-hard under a traditional due date definition admits an efficient algorithm under the new definition. As well as determining the complexity of many generalized due date scheduling problems, including one published open problem, we also describe several problems, the complexity of which is still unresolved.

Keywords: Machine scheduling, complexity theory, due dates, NP-complete

JEL Classification: M11, C00

Suggested Citation

Hall, Nicholas G. and Sethi, Suresh and Sriskandarajah, Chelliah, On the Complexity of Generalized Due Date Scheduling Problems (1991). European Journal of Operational Research, Vol. 51, No. 1, pp. 100-109, March 1991, Available at SSRN: https://ssrn.com/abstract=1117346

Nicholas G. Hall

Ohio State University (OSU) - Department of Management Sciences ( email )

United States

Suresh Sethi (Contact Author)

University of Texas at Dallas - Naveen Jindal School of Management ( email )

800 W. Campbell Road, SM30
Richardson, TX 75080-3021
United States

Chelliah Sriskandarajah

Texas A&M University ( email )

Langford Building A
798 Ross St.
77843-3137

Do you have a job opening that you would like to promote on SSRN?

Paper statistics

Downloads
28
Abstract Views
607
PlumX Metrics