Efficient mixed integer programming formulations and dispatching rules for parallel machine scheduling with allowing machine idle times

Chi-Yang Tsai and Yi-Chen Wang

International Journal of Industrial and Systems Engineering, 2015, vol. 21, issue 3, 320-333

Abstract: This paper proposes mixed integer programming formulations for the unrelated parallel-machines scheduling problem with allowing machine idle times given the objective of minimising the total earliness and tardiness. Experiment and analysis are conducted to gain insight into the effect of allowing machine idle time to job schedule performance. Simple dispatching rules are applied for better solution efficiency. Experiment results show that allowing machine idle times can be better utilised with job due dates are loose and the dispatching rules are very competitive for efficiency and quality of solutions.

Keywords: parallel machine scheduling; unrelated parallel machines; idle time; earliness; tardiness; mixed integer programming; dispatching rules; due dates. (search for similar items in EconPapers)
Date: 2015
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=72269 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijisen:v:21:y:2015:i:3:p:320-333

Access Statistics for this article

More articles in International Journal of Industrial and Systems Engineering from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().