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

Mary E. Kurz, Ronald Askin

Research output: Contribution to journalArticle

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 - 2001

Fingerprint

Scheduling

ASJC Scopus subject areas

  • Industrial and Manufacturing Engineering

Cite this

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

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

Research output: Contribution to journalArticle

@article{447e2e0276834cc3b7fa44d999cb9ec1,
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, {Mary E.} and Ronald Askin",
year = "2001",
doi = "10.1080/07408170108936865",
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, Mary E.

AU - Askin, Ronald

PY - 2001

Y1 - 2001

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=85023802581&partnerID=8YFLogxK

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

U2 - 10.1080/07408170108936865

DO - 10.1080/07408170108936865

M3 - Article

AN - SCOPUS:85023802581

VL - 33

SP - 691

EP - 693

JO - IISE Transactions

JF - IISE Transactions

SN - 2472-5854

IS - 8

ER -