Real-time scheduling of multi-stage flexible job shop floor

Myoungsoo Ham, Young Hoon Lee, Sun Hoon Kim

Research output: Contribution to journalArticle

19 Citations (Scopus)

Abstract

This paper first formulates a binary integer programming (BIP) model that minimises Cmax for a multi-stage flexible job shop floor with machine compatibility. Due to a computational limitation, the exact optimal model is then relaxed as a linear programming model. The output from the relaxation model then turns into the objective of the BIP-based real-time scheduling (RTS) heuristic model. The RTS heuristic requires an iteration to calculate the final Cmax. At each iteration, the RTS heuristic assigns just one job to the earliest available machines. Since the set of jobs and machines included in the RTS model is relatively small, RTS can be solved in a very short computational time. We evaluate an overall effectiveness (in terms of solution quality and run time) of the RTS heuristic by way of computer experiments.

Original languageEnglish
Pages (from-to)3715-3730
Number of pages16
JournalInternational Journal of Production Research
Volume49
Issue number12
DOIs
Publication statusPublished - 2011 Jun 15

Fingerprint

Scheduling
Integer programming
Linear programming
Shopfloor
Job shop
Heuristics
Experiments

All Science Journal Classification (ASJC) codes

  • Industrial and Manufacturing Engineering
  • Management Science and Operations Research
  • Strategy and Management

Cite this

@article{868e8786ed6146ccba80d2fd77b770ff,
title = "Real-time scheduling of multi-stage flexible job shop floor",
abstract = "This paper first formulates a binary integer programming (BIP) model that minimises Cmax for a multi-stage flexible job shop floor with machine compatibility. Due to a computational limitation, the exact optimal model is then relaxed as a linear programming model. The output from the relaxation model then turns into the objective of the BIP-based real-time scheduling (RTS) heuristic model. The RTS heuristic requires an iteration to calculate the final Cmax. At each iteration, the RTS heuristic assigns just one job to the earliest available machines. Since the set of jobs and machines included in the RTS model is relatively small, RTS can be solved in a very short computational time. We evaluate an overall effectiveness (in terms of solution quality and run time) of the RTS heuristic by way of computer experiments.",
author = "Myoungsoo Ham and Lee, {Young Hoon} and Kim, {Sun Hoon}",
year = "2011",
month = "6",
day = "15",
doi = "10.1080/00207543.2010.492797",
language = "English",
volume = "49",
pages = "3715--3730",
journal = "International Journal of Production Research",
issn = "0020-7543",
publisher = "Taylor and Francis Ltd.",
number = "12",

}

Real-time scheduling of multi-stage flexible job shop floor. / Ham, Myoungsoo; Lee, Young Hoon; Kim, Sun Hoon.

In: International Journal of Production Research, Vol. 49, No. 12, 15.06.2011, p. 3715-3730.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Real-time scheduling of multi-stage flexible job shop floor

AU - Ham, Myoungsoo

AU - Lee, Young Hoon

AU - Kim, Sun Hoon

PY - 2011/6/15

Y1 - 2011/6/15

N2 - This paper first formulates a binary integer programming (BIP) model that minimises Cmax for a multi-stage flexible job shop floor with machine compatibility. Due to a computational limitation, the exact optimal model is then relaxed as a linear programming model. The output from the relaxation model then turns into the objective of the BIP-based real-time scheduling (RTS) heuristic model. The RTS heuristic requires an iteration to calculate the final Cmax. At each iteration, the RTS heuristic assigns just one job to the earliest available machines. Since the set of jobs and machines included in the RTS model is relatively small, RTS can be solved in a very short computational time. We evaluate an overall effectiveness (in terms of solution quality and run time) of the RTS heuristic by way of computer experiments.

AB - This paper first formulates a binary integer programming (BIP) model that minimises Cmax for a multi-stage flexible job shop floor with machine compatibility. Due to a computational limitation, the exact optimal model is then relaxed as a linear programming model. The output from the relaxation model then turns into the objective of the BIP-based real-time scheduling (RTS) heuristic model. The RTS heuristic requires an iteration to calculate the final Cmax. At each iteration, the RTS heuristic assigns just one job to the earliest available machines. Since the set of jobs and machines included in the RTS model is relatively small, RTS can be solved in a very short computational time. We evaluate an overall effectiveness (in terms of solution quality and run time) of the RTS heuristic by way of computer experiments.

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

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

U2 - 10.1080/00207543.2010.492797

DO - 10.1080/00207543.2010.492797

M3 - Article

AN - SCOPUS:79953808353

VL - 49

SP - 3715

EP - 3730

JO - International Journal of Production Research

JF - International Journal of Production Research

SN - 0020-7543

IS - 12

ER -