Minimising earliness and tardiness on parallel machines with sequence-dependent setups

Ghazi M. Magableh and Scott J. Mason

International Journal of Operational Research, 2010, vol. 8, issue 1, 42-61

Abstract: In this paper, we present heuristics for minimising total earliness and tardiness on a group of identical, parallel machines subject to sequence-dependent setups. Each job has a potentially unique due date, processing time and/or ready time. Our approach generates an initial feasible schedule using new algorithms and a dispatching rule, and then employs a local search procedure to improve this initial schedule when possible. Experimental results demonstrate the viability of our approach over a wide range of problem instances to produce near-optimal solutions in practically acceptable computation times.

Keywords: earliness; tardiness; parallel machines; parallel machine scheduling; sequence-dependent setups; dispatching rules; due dates. (search for similar items in EconPapers)
Date: 2010
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=33103 (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:ijores:v:8:y:2010:i:1:p:42-61

Access Statistics for this article

More articles in International Journal of Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().