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

Authors: Magableh, Ghazi M.¹; Mason, Scott J.²

Source: International Journal of Operational Research, Volume 8, Number 1, 8 May 2010 , pp. 42-61(20)

Buy & download fulltext article:

Price: $44.11 plus tax (Refund Policy)

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: TECHNICAL JOURNALS; Materials and Manufacturing; MANAGEMENT JOURNALS; Operational Management, Marketing and Services

Document Type: Research article

DOI: http://dx.doi.org/10.1504/IJOR.2010.033103

Affiliations: 1: Department of Mechanical Engineering, Prince Faisal Technical College (PFTC), Al-Balqa 2: Applied University (BAU), Amman, Jordan.

Publication date: 2010-05-08

More about this publication?