Minimising earliness and tardiness on parallel machines with sequence-dependent setups
by Ghazi M. Magableh, Scott J. Mason
International Journal of Operational Research (IJOR), Vol. 8, No. 1, 2010

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.

Online publication date: Sat, 08-May-2010

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Operational Research (IJOR):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com