Scheduling job families about an unrestricted common due date on a single machine

M. Azizoglu, Scott Webster

Research output: Contribution to journalArticle

29 Citations (Scopus)

Abstract

We consider the NP-hard problem of scheduling jobs on a single machine about an unrestricted due date to minimize total weighted earliness and tardiness cost. Jobs are grouped into families where jobs in the same family share a setup; a setup time is required between the processing of two jobs from different families. Each job has an earliness penalty rate and a tardiness penalty rate that are allowed to be arbitrary. These rates are assessed on a per-period basis when the completion time deviates from its due date. In this paper, we generalize properties from the literature that characterize the structure of an optimal schedule, present a lower bound, propose a branch and bound algorithm and a beam search procedure, and report results from a computational experiment. We find that optimal solutions can be quickly obtained for smaller problem instances. For large problems, we find high quality solutions within a few minutes of CPU time.

Original languageEnglish (US)
Pages (from-to)1321-1330
Number of pages10
JournalInternational Journal of Production Research
Volume35
Issue number5
StatePublished - May 1997
Externally publishedYes

Fingerprint

Program processors
Computational complexity
Scheduling
Processing
Costs
Experiments
Single machine
Due dates
Penalty
Tardiness

ASJC Scopus subject areas

  • Management Science and Operations Research
  • Industrial and Manufacturing Engineering

Cite this

Scheduling job families about an unrestricted common due date on a single machine. / Azizoglu, M.; Webster, Scott.

In: International Journal of Production Research, Vol. 35, No. 5, 05.1997, p. 1321-1330.

Research output: Contribution to journalArticle

@article{db2844c26bf54c50825b3d6f29095bf7,
title = "Scheduling job families about an unrestricted common due date on a single machine",
abstract = "We consider the NP-hard problem of scheduling jobs on a single machine about an unrestricted due date to minimize total weighted earliness and tardiness cost. Jobs are grouped into families where jobs in the same family share a setup; a setup time is required between the processing of two jobs from different families. Each job has an earliness penalty rate and a tardiness penalty rate that are allowed to be arbitrary. These rates are assessed on a per-period basis when the completion time deviates from its due date. In this paper, we generalize properties from the literature that characterize the structure of an optimal schedule, present a lower bound, propose a branch and bound algorithm and a beam search procedure, and report results from a computational experiment. We find that optimal solutions can be quickly obtained for smaller problem instances. For large problems, we find high quality solutions within a few minutes of CPU time.",
author = "M. Azizoglu and Scott Webster",
year = "1997",
month = "5",
language = "English (US)",
volume = "35",
pages = "1321--1330",
journal = "International Journal of Production Research",
issn = "0020-7543",
publisher = "Taylor and Francis Ltd.",
number = "5",

}

TY - JOUR

T1 - Scheduling job families about an unrestricted common due date on a single machine

AU - Azizoglu, M.

AU - Webster, Scott

PY - 1997/5

Y1 - 1997/5

N2 - We consider the NP-hard problem of scheduling jobs on a single machine about an unrestricted due date to minimize total weighted earliness and tardiness cost. Jobs are grouped into families where jobs in the same family share a setup; a setup time is required between the processing of two jobs from different families. Each job has an earliness penalty rate and a tardiness penalty rate that are allowed to be arbitrary. These rates are assessed on a per-period basis when the completion time deviates from its due date. In this paper, we generalize properties from the literature that characterize the structure of an optimal schedule, present a lower bound, propose a branch and bound algorithm and a beam search procedure, and report results from a computational experiment. We find that optimal solutions can be quickly obtained for smaller problem instances. For large problems, we find high quality solutions within a few minutes of CPU time.

AB - We consider the NP-hard problem of scheduling jobs on a single machine about an unrestricted due date to minimize total weighted earliness and tardiness cost. Jobs are grouped into families where jobs in the same family share a setup; a setup time is required between the processing of two jobs from different families. Each job has an earliness penalty rate and a tardiness penalty rate that are allowed to be arbitrary. These rates are assessed on a per-period basis when the completion time deviates from its due date. In this paper, we generalize properties from the literature that characterize the structure of an optimal schedule, present a lower bound, propose a branch and bound algorithm and a beam search procedure, and report results from a computational experiment. We find that optimal solutions can be quickly obtained for smaller problem instances. For large problems, we find high quality solutions within a few minutes of CPU time.

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

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

M3 - Article

AN - SCOPUS:0031147485

VL - 35

SP - 1321

EP - 1330

JO - International Journal of Production Research

JF - International Journal of Production Research

SN - 0020-7543

IS - 5

ER -