Scheduling about an unrestricted common due window with arbitrary earliness/tardiness penalty rates

Meral Azizoglu, Scott Webster

Research output: Contribution to journalArticle

15 Scopus citations

Abstract

We consider the NP-hard problem of scheduling jobs on a single machine about an unrestricted due window to minimize total weighted earliness and tardiness cost. Each job has an earliness penalty rate and a tardiness penalty rate that are allowed to be arbitrary. Earliness or tardiness cost is assessed when a job completes outside the due window, which may be an instant in time or a time increment defining acceptable job completion. In this paper we present properties that characterize the structure of an optimal schedule, present a lower bound, propose a two-step branch and bound algorithm, and report results from a computational experiment. We find that optimal solutions can be quickly obtained for medium-sized problem instances.

Original languageEnglish (US)
Pages (from-to)1001-1006
Number of pages6
JournalIIE Transactions (Institute of Industrial Engineers)
Volume29
Issue number11
DOIs
StatePublished - Jan 1 1997
Externally publishedYes

ASJC Scopus subject areas

  • Industrial and Manufacturing Engineering

Fingerprint Dive into the research topics of 'Scheduling about an unrestricted common due window with arbitrary earliness/tardiness penalty rates'. Together they form a unique fingerprint.

  • Cite this