Scheduling flexible flow lines with sequence-dependent setup times

Mary E. Kurz, Ronald Askin

Research output: Contribution to journalArticle

188 Citations (Scopus)

Abstract

This paper examines scheduling in flexible flow lines with sequence-dependent setup times to minimize makespan. This type of manufacturing environment is found in industries such as printed circuit board and automobile manufacture. An integer program that incorporates these aspects of the problem is formulated and discussed. Because of the difficulty in solving the IP directly, several heuristics are developed, based on greedy methods, flow line methods, the Insertion Heuristic for the Traveling Salesman Problem and the Random Keys Genetic Algorithm. Problem data is generated in order to evaluate the heuristics. The characteristics are chosen to reflect those used by previous researchers. A lower bound has been created in order to evaluate the heuristics, and is itself evaluated. An application of the Random Keys Genetic Algorithm is found to be very effective for the problems examined. Conclusions are then drawn and areas for future research are identified.

Original languageEnglish (US)
Pages (from-to)66-82
Number of pages17
JournalEuropean Journal of Operational Research
Volume159
Issue number1
DOIs
StatePublished - Nov 16 2004

Fingerprint

Sequence-dependent Setup Times
scheduling
heuristics
Automobile manufacture
Genetic algorithms
Scheduling
Heuristics
Traveling salesman problem
Line
Printed circuit boards
Genetic Algorithm
salesman
Printed Circuit Board
Evaluate
Integer Program
Automobile
Travelling salesman problems
Insertion
motor vehicle
Industry

Keywords

  • Flexible flow lines
  • Genetic algorithms
  • Heuristics
  • Scheduling

ASJC Scopus subject areas

  • Information Systems and Management
  • Management Science and Operations Research
  • Statistics, Probability and Uncertainty
  • Applied Mathematics
  • Modeling and Simulation
  • Transportation

Cite this

Scheduling flexible flow lines with sequence-dependent setup times. / Kurz, Mary E.; Askin, Ronald.

In: European Journal of Operational Research, Vol. 159, No. 1, 16.11.2004, p. 66-82.

Research output: Contribution to journalArticle

@article{011edf18e55c4b19b9082bc32d9b9d79,
title = "Scheduling flexible flow lines with sequence-dependent setup times",
abstract = "This paper examines scheduling in flexible flow lines with sequence-dependent setup times to minimize makespan. This type of manufacturing environment is found in industries such as printed circuit board and automobile manufacture. An integer program that incorporates these aspects of the problem is formulated and discussed. Because of the difficulty in solving the IP directly, several heuristics are developed, based on greedy methods, flow line methods, the Insertion Heuristic for the Traveling Salesman Problem and the Random Keys Genetic Algorithm. Problem data is generated in order to evaluate the heuristics. The characteristics are chosen to reflect those used by previous researchers. A lower bound has been created in order to evaluate the heuristics, and is itself evaluated. An application of the Random Keys Genetic Algorithm is found to be very effective for the problems examined. Conclusions are then drawn and areas for future research are identified.",
keywords = "Flexible flow lines, Genetic algorithms, Heuristics, Scheduling",
author = "Kurz, {Mary E.} and Ronald Askin",
year = "2004",
month = "11",
day = "16",
doi = "10.1016/S0377-2217(03)00401-6",
language = "English (US)",
volume = "159",
pages = "66--82",
journal = "European Journal of Operational Research",
issn = "0377-2217",
publisher = "Elsevier",
number = "1",

}

TY - JOUR

T1 - Scheduling flexible flow lines with sequence-dependent setup times

AU - Kurz, Mary E.

AU - Askin, Ronald

PY - 2004/11/16

Y1 - 2004/11/16

N2 - This paper examines scheduling in flexible flow lines with sequence-dependent setup times to minimize makespan. This type of manufacturing environment is found in industries such as printed circuit board and automobile manufacture. An integer program that incorporates these aspects of the problem is formulated and discussed. Because of the difficulty in solving the IP directly, several heuristics are developed, based on greedy methods, flow line methods, the Insertion Heuristic for the Traveling Salesman Problem and the Random Keys Genetic Algorithm. Problem data is generated in order to evaluate the heuristics. The characteristics are chosen to reflect those used by previous researchers. A lower bound has been created in order to evaluate the heuristics, and is itself evaluated. An application of the Random Keys Genetic Algorithm is found to be very effective for the problems examined. Conclusions are then drawn and areas for future research are identified.

AB - This paper examines scheduling in flexible flow lines with sequence-dependent setup times to minimize makespan. This type of manufacturing environment is found in industries such as printed circuit board and automobile manufacture. An integer program that incorporates these aspects of the problem is formulated and discussed. Because of the difficulty in solving the IP directly, several heuristics are developed, based on greedy methods, flow line methods, the Insertion Heuristic for the Traveling Salesman Problem and the Random Keys Genetic Algorithm. Problem data is generated in order to evaluate the heuristics. The characteristics are chosen to reflect those used by previous researchers. A lower bound has been created in order to evaluate the heuristics, and is itself evaluated. An application of the Random Keys Genetic Algorithm is found to be very effective for the problems examined. Conclusions are then drawn and areas for future research are identified.

KW - Flexible flow lines

KW - Genetic algorithms

KW - Heuristics

KW - Scheduling

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

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

U2 - 10.1016/S0377-2217(03)00401-6

DO - 10.1016/S0377-2217(03)00401-6

M3 - Article

VL - 159

SP - 66

EP - 82

JO - European Journal of Operational Research

JF - European Journal of Operational Research

SN - 0377-2217

IS - 1

ER -