An adaptable problem-space-based search method for flexible flow line scheduling

M. E. Kurz, Ronald Askin

Research output: Contribution to journalArticle

12 Citations (Scopus)

Abstract

Leon and Ramamoorthy (1997) developed an adaptable problem-space-based search method. Part of that work included development of a lower bound and comparison of makespans using real-world data. In this note we improve their lower bound and show that the Leon and Ramamoorthy search method found better makespan solutions than their lower bound indicated, including some optimal makespans.

Original languageEnglish (US)
Pages (from-to)691-693
Number of pages3
JournalIIE Transactions (Institute of Industrial Engineers)
Volume33
Issue number8
DOIs
StatePublished - Aug 2001

Fingerprint

Scheduling
Lower bounds
Flow line
Makespan

ASJC Scopus subject areas

  • Management Science and Operations Research
  • Industrial and Manufacturing Engineering

Cite this

An adaptable problem-space-based search method for flexible flow line scheduling. / Kurz, M. E.; Askin, Ronald.

In: IIE Transactions (Institute of Industrial Engineers), Vol. 33, No. 8, 08.2001, p. 691-693.

Research output: Contribution to journalArticle

@article{c42020f99c884183b6f18659df65b09e,
title = "An adaptable problem-space-based search method for flexible flow line scheduling",
abstract = "Leon and Ramamoorthy (1997) developed an adaptable problem-space-based search method. Part of that work included development of a lower bound and comparison of makespans using real-world data. In this note we improve their lower bound and show that the Leon and Ramamoorthy search method found better makespan solutions than their lower bound indicated, including some optimal makespans.",
author = "Kurz, {M. E.} and Ronald Askin",
year = "2001",
month = "8",
doi = "10.1023/A:1010943502591",
language = "English (US)",
volume = "33",
pages = "691--693",
journal = "IISE Transactions",
issn = "2472-5854",
publisher = "Taylor and Francis Ltd.",
number = "8",

}

TY - JOUR

T1 - An adaptable problem-space-based search method for flexible flow line scheduling

AU - Kurz, M. E.

AU - Askin, Ronald

PY - 2001/8

Y1 - 2001/8

N2 - Leon and Ramamoorthy (1997) developed an adaptable problem-space-based search method. Part of that work included development of a lower bound and comparison of makespans using real-world data. In this note we improve their lower bound and show that the Leon and Ramamoorthy search method found better makespan solutions than their lower bound indicated, including some optimal makespans.

AB - Leon and Ramamoorthy (1997) developed an adaptable problem-space-based search method. Part of that work included development of a lower bound and comparison of makespans using real-world data. In this note we improve their lower bound and show that the Leon and Ramamoorthy search method found better makespan solutions than their lower bound indicated, including some optimal makespans.

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

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

U2 - 10.1023/A:1010943502591

DO - 10.1023/A:1010943502591

M3 - Article

VL - 33

SP - 691

EP - 693

JO - IISE Transactions

JF - IISE Transactions

SN - 2472-5854

IS - 8

ER -