Heuristics for minimizing total weighted tardiness in complex job shops

S. J. Mason, John Fowler, W. M. Carlyle, Douglas Montgomery

Research output: Contribution to journalArticle

28 Citations (Scopus)

Abstract

Semi-conductor manufacturing is arguably one of the most complex manufacturing processes in existence today. A semi-conductor wafer fabrication facility is comprised of batching machines, parallel machines, machines with sequence-dependent set-ups, and re-circulating product flow. The individual job release times and due dates combine with the other processing environment characteristics to form a 'complex' job shop scheduling problem. We first present a mixed-integer program (MIP) to minimize total weighted tardiness in a complex job shop. Since the problem is NP-hard, we compare a heuristic based on the MIP (MIP heuristic) with both a tuned version of a modified shifting bottleneck heuristic (SB heuristic) and three dispatching rules using random problem instances of a representative model from the literature. While the MIP heuristic typically produces superior schedules for problem instances with a small number of jobs, the SB heuristic consistently outperforms the MIP heuristic for larger problem instances. The SB heuristic's superior performance as compared to additional dispatching rules is also demonstrated for a larger, 'real world' dataset from the literature.

Original languageEnglish (US)
Pages (from-to)1943-1963
Number of pages21
JournalInternational Journal of Production Research
Volume43
Issue number10
DOIs
StatePublished - May 15 2005

Fingerprint

Computational complexity
Fabrication
Processing
Job shop
Heuristics
Tardiness
Mixed integer program
Job shop scheduling
Dispatching rules

Keywords

  • Heuristic
  • Integer programming
  • Scheduling
  • Shifting bottleneck

ASJC Scopus subject areas

  • Industrial and Manufacturing Engineering
  • Management Science and Operations Research

Cite this

Heuristics for minimizing total weighted tardiness in complex job shops. / Mason, S. J.; Fowler, John; Carlyle, W. M.; Montgomery, Douglas.

In: International Journal of Production Research, Vol. 43, No. 10, 15.05.2005, p. 1943-1963.

Research output: Contribution to journalArticle

@article{3635fe0e433d441885d9bb07523117ef,
title = "Heuristics for minimizing total weighted tardiness in complex job shops",
abstract = "Semi-conductor manufacturing is arguably one of the most complex manufacturing processes in existence today. A semi-conductor wafer fabrication facility is comprised of batching machines, parallel machines, machines with sequence-dependent set-ups, and re-circulating product flow. The individual job release times and due dates combine with the other processing environment characteristics to form a 'complex' job shop scheduling problem. We first present a mixed-integer program (MIP) to minimize total weighted tardiness in a complex job shop. Since the problem is NP-hard, we compare a heuristic based on the MIP (MIP heuristic) with both a tuned version of a modified shifting bottleneck heuristic (SB heuristic) and three dispatching rules using random problem instances of a representative model from the literature. While the MIP heuristic typically produces superior schedules for problem instances with a small number of jobs, the SB heuristic consistently outperforms the MIP heuristic for larger problem instances. The SB heuristic's superior performance as compared to additional dispatching rules is also demonstrated for a larger, 'real world' dataset from the literature.",
keywords = "Heuristic, Integer programming, Scheduling, Shifting bottleneck",
author = "Mason, {S. J.} and John Fowler and Carlyle, {W. M.} and Douglas Montgomery",
year = "2005",
month = "5",
day = "15",
doi = "10.1080/00207540412331331399",
language = "English (US)",
volume = "43",
pages = "1943--1963",
journal = "International Journal of Production Research",
issn = "0020-7543",
publisher = "Taylor and Francis Ltd.",
number = "10",

}

TY - JOUR

T1 - Heuristics for minimizing total weighted tardiness in complex job shops

AU - Mason, S. J.

AU - Fowler, John

AU - Carlyle, W. M.

AU - Montgomery, Douglas

PY - 2005/5/15

Y1 - 2005/5/15

N2 - Semi-conductor manufacturing is arguably one of the most complex manufacturing processes in existence today. A semi-conductor wafer fabrication facility is comprised of batching machines, parallel machines, machines with sequence-dependent set-ups, and re-circulating product flow. The individual job release times and due dates combine with the other processing environment characteristics to form a 'complex' job shop scheduling problem. We first present a mixed-integer program (MIP) to minimize total weighted tardiness in a complex job shop. Since the problem is NP-hard, we compare a heuristic based on the MIP (MIP heuristic) with both a tuned version of a modified shifting bottleneck heuristic (SB heuristic) and three dispatching rules using random problem instances of a representative model from the literature. While the MIP heuristic typically produces superior schedules for problem instances with a small number of jobs, the SB heuristic consistently outperforms the MIP heuristic for larger problem instances. The SB heuristic's superior performance as compared to additional dispatching rules is also demonstrated for a larger, 'real world' dataset from the literature.

AB - Semi-conductor manufacturing is arguably one of the most complex manufacturing processes in existence today. A semi-conductor wafer fabrication facility is comprised of batching machines, parallel machines, machines with sequence-dependent set-ups, and re-circulating product flow. The individual job release times and due dates combine with the other processing environment characteristics to form a 'complex' job shop scheduling problem. We first present a mixed-integer program (MIP) to minimize total weighted tardiness in a complex job shop. Since the problem is NP-hard, we compare a heuristic based on the MIP (MIP heuristic) with both a tuned version of a modified shifting bottleneck heuristic (SB heuristic) and three dispatching rules using random problem instances of a representative model from the literature. While the MIP heuristic typically produces superior schedules for problem instances with a small number of jobs, the SB heuristic consistently outperforms the MIP heuristic for larger problem instances. The SB heuristic's superior performance as compared to additional dispatching rules is also demonstrated for a larger, 'real world' dataset from the literature.

KW - Heuristic

KW - Integer programming

KW - Scheduling

KW - Shifting bottleneck

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

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

U2 - 10.1080/00207540412331331399

DO - 10.1080/00207540412331331399

M3 - Article

AN - SCOPUS:27944487498

VL - 43

SP - 1943

EP - 1963

JO - International Journal of Production Research

JF - International Journal of Production Research

SN - 0020-7543

IS - 10

ER -