IP-based real-time dispatching for two-machine batching problem with time window constraints

Myoungsoo Ham, Young Hoon Lee, Jaehyung An

Research output: Contribution to journalArticle

6 Citations (Scopus)

Abstract

A binary integer programming based real-time dispatching heuristic (i-RTD) approach to minimize the makespan of the two-machine batching flow-shop problem with time window constraints is presented for the first time. By scheduling only necessary batches at each iteration, i-RTD works with considerably fewer binary variables so that it runs in real-time. The experimental study demonstrates the proposed i-RTD can generate the efficient solution in real-time, which implies we can implement the proposed approach into real industry where a quick and efficient schedule is required.

Original languageEnglish
Article number5692129
Pages (from-to)589-597
Number of pages9
JournalIEEE Transactions on Automation Science and Engineering
Volume8
Issue number3
DOIs
Publication statusPublished - 2011 Jul

All Science Journal Classification (ASJC) codes

  • Control and Systems Engineering
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'IP-based real-time dispatching for two-machine batching problem with time window constraints'. Together they form a unique fingerprint.

  • Cite this