Dynamic hoist scheduling problem with multi-capacity reentrant machines: A mixed integer programming approach

Jianguang Feng, Ada Che, Chengbin Chu

Research output: Contribution to journalArticlepeer-review

32 Scopus citations

Abstract

Abstract This paper deals with the dynamic hoist scheduling problem with multi-capacity reentrant machines, where some reentrant machines have parallel processing units and can process multiple jobs at the same time. The system is served by a hoist for transporting jobs among machines. Jobs to be processed randomly arrive at the input station. When new jobs come, the system should be rescheduled so as to minimize the makespan. A mixed integer programming (MIP) model is developed to generate an optimal reschedule, which improves an existing model in the literature from several dimensions. The proposed model is solved by commercial software CPLEX. Computational results are reported to evaluate the proposed MIP model.

Original languageEnglish
Article number4074
Pages (from-to)611-620
Number of pages10
JournalComputers and Industrial Engineering
Volume87
DOIs
StatePublished - 9 Jul 2015

Keywords

  • Dynamic hoist scheduling
  • Mixed integer programming (MIP)
  • Multi-capacity reentrant machine
  • Rescheduling

Fingerprint

Dive into the research topics of 'Dynamic hoist scheduling problem with multi-capacity reentrant machines: A mixed integer programming approach'. Together they form a unique fingerprint.

Cite this