Comparing scheduling rules for flexible flow lines

Mary E. Kurz, Ronald Askin

Research output: Contribution to journalArticle

122 Citations (Scopus)

Abstract

This paper explores scheduling flexible flow lines with sequence-dependent setup times. Three major types of heuristics are explored. Insertion heuristics (based on insertion heuristics for the traveling salesman problem) attempt to simultaneously equalize workload on all processors at a stage, and minimize total or single-stage flowtimes. Johnson's algorithm for two-stage flow shops and its heuristic extensions to m-machine flow shops are modified for parallel processors and the flexible flow-line environment. A set of naïve greedy heuristics is investigated for comparison purposes. The performance of the heuristics is compared on a set of test problems. Results indicate the range of conditions under which each method performs well.

Original languageEnglish (US)
Pages (from-to)371-388
Number of pages18
JournalInternational Journal of Production Economics
Volume85
Issue number3
DOIs
StatePublished - Sep 11 2003

Fingerprint

Traveling salesman problem
Scheduling
Scheduling rules
Flow line
Heuristics

Keywords

  • Flexible flow lines
  • Heuristics
  • Makespan
  • Scheduling
  • Sequence-dependent setup times

ASJC Scopus subject areas

  • Economics and Econometrics
  • Industrial and Manufacturing Engineering

Cite this

Comparing scheduling rules for flexible flow lines. / Kurz, Mary E.; Askin, Ronald.

In: International Journal of Production Economics, Vol. 85, No. 3, 11.09.2003, p. 371-388.

Research output: Contribution to journalArticle

@article{e0b47b4617814fe79fbfbdf596b5b35b,
title = "Comparing scheduling rules for flexible flow lines",
abstract = "This paper explores scheduling flexible flow lines with sequence-dependent setup times. Three major types of heuristics are explored. Insertion heuristics (based on insertion heuristics for the traveling salesman problem) attempt to simultaneously equalize workload on all processors at a stage, and minimize total or single-stage flowtimes. Johnson's algorithm for two-stage flow shops and its heuristic extensions to m-machine flow shops are modified for parallel processors and the flexible flow-line environment. A set of na{\"i}ve greedy heuristics is investigated for comparison purposes. The performance of the heuristics is compared on a set of test problems. Results indicate the range of conditions under which each method performs well.",
keywords = "Flexible flow lines, Heuristics, Makespan, Scheduling, Sequence-dependent setup times",
author = "Kurz, {Mary E.} and Ronald Askin",
year = "2003",
month = "9",
day = "11",
doi = "10.1016/S0925-5273(03)00123-3",
language = "English (US)",
volume = "85",
pages = "371--388",
journal = "International Journal of Production Economics",
issn = "0925-5273",
publisher = "Elsevier",
number = "3",

}

TY - JOUR

T1 - Comparing scheduling rules for flexible flow lines

AU - Kurz, Mary E.

AU - Askin, Ronald

PY - 2003/9/11

Y1 - 2003/9/11

N2 - This paper explores scheduling flexible flow lines with sequence-dependent setup times. Three major types of heuristics are explored. Insertion heuristics (based on insertion heuristics for the traveling salesman problem) attempt to simultaneously equalize workload on all processors at a stage, and minimize total or single-stage flowtimes. Johnson's algorithm for two-stage flow shops and its heuristic extensions to m-machine flow shops are modified for parallel processors and the flexible flow-line environment. A set of naïve greedy heuristics is investigated for comparison purposes. The performance of the heuristics is compared on a set of test problems. Results indicate the range of conditions under which each method performs well.

AB - This paper explores scheduling flexible flow lines with sequence-dependent setup times. Three major types of heuristics are explored. Insertion heuristics (based on insertion heuristics for the traveling salesman problem) attempt to simultaneously equalize workload on all processors at a stage, and minimize total or single-stage flowtimes. Johnson's algorithm for two-stage flow shops and its heuristic extensions to m-machine flow shops are modified for parallel processors and the flexible flow-line environment. A set of naïve greedy heuristics is investigated for comparison purposes. The performance of the heuristics is compared on a set of test problems. Results indicate the range of conditions under which each method performs well.

KW - Flexible flow lines

KW - Heuristics

KW - Makespan

KW - Scheduling

KW - Sequence-dependent setup times

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

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

U2 - 10.1016/S0925-5273(03)00123-3

DO - 10.1016/S0925-5273(03)00123-3

M3 - Article

AN - SCOPUS:0038486864

VL - 85

SP - 371

EP - 388

JO - International Journal of Production Economics

JF - International Journal of Production Economics

SN - 0925-5273

IS - 3

ER -