Minimizing the Maximum Earliness-Tardiness on a Single Machine with Generalized Due-Dates

12 Pages Posted: 12 Dec 2019

See all articles by Daniel Oron

Daniel Oron

University of Sydney Business School

Amir Salehipour

University of Technology Sydney, Australia; University of Technology Sydney (UTS)

Date Written: September 4, 2019

Abstract

This paper considers a single machine scheduling problem with generalized due-dates (GDD) to minimize the maximum earliness and tardiness. Under the assumption of GDD, due-dates are not job-dependent but rather associated with the number of jobs previously processed. First, we prove that the problem is strongly NP-hard by reduction to the well-known 3-partition problem. We then formulate three lower-bounds on the optimal solution, and develop an efficient heuristic for the problem. The heuristic is shown to perform very well through an extensive numerical study.

Keywords: Single machine; Earliness; Tardiness; Generalized due-dates

Suggested Citation

Oron, Daniel and Salehipour, Amir and Salehipour, Amir, Minimizing the Maximum Earliness-Tardiness on a Single Machine with Generalized Due-Dates (September 4, 2019). Available at SSRN: https://ssrn.com/abstract=3492849 or http://dx.doi.org/10.2139/ssrn.3492849

Daniel Oron

University of Sydney Business School ( email )

Cnr. of Codrington and Rose Streets
Sydney, NSW 2006
Australia

Amir Salehipour (Contact Author)

University of Technology Sydney, Australia ( email )

Ultimo
Ultimo, NSW 2007
Australia

University of Technology Sydney (UTS) ( email )

15 Broadway, Ultimo
PO Box 123
Sydney, NSW 2007
Australia

Do you have negative results from your research you’d like to share?

Paper statistics

Downloads
85
Abstract Views
561
Rank
531,697
PlumX Metrics