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

Meral Azizoglu, Scott Webster

Research output: Contribution to journalArticle

14 Citations (Scopus)

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
StatePublished - 1997
Externally publishedYes

Fingerprint

Scheduling
Costs
Computational complexity
Experiments
Penalty
Due window
Tardiness

ASJC Scopus subject areas

  • Industrial and Manufacturing Engineering
  • Management Science and Operations Research

Cite this

Scheduling about an unrestricted common due window with arbitrary earliness/tardiness penalty rates. / Azizoglu, Meral; Webster, Scott.

In: IIE Transactions (Institute of Industrial Engineers), Vol. 29, No. 11, 1997, p. 1001-1006.

Research output: Contribution to journalArticle

@article{4e80f2a8e1124a1ba8675318c1eb9b84,
title = "Scheduling about an unrestricted common due window with arbitrary earliness/tardiness penalty rates",
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.",
author = "Meral Azizoglu and Scott Webster",
year = "1997",
language = "English (US)",
volume = "29",
pages = "1001--1006",
journal = "IISE Transactions",
issn = "2472-5854",
publisher = "Taylor and Francis Ltd.",
number = "11",

}

TY - JOUR

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

AU - Azizoglu, Meral

AU - Webster, Scott

PY - 1997

Y1 - 1997

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0031275545&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0031275545&partnerID=8YFLogxK

M3 - Article

VL - 29

SP - 1001

EP - 1006

JO - IISE Transactions

JF - IISE Transactions

SN - 2472-5854

IS - 11

ER -