A scheduling problem with unrelated parallel machines and sequence dependent setups
by M. Gomez Ravetti, Geraldo R. Mateus, Pedro L. Rocha, Panos M. Pardalos
International Journal of Operational Research (IJOR), Vol. 2, No. 4, 2007

Abstract: This paper addresses a scheduling problem with unrelated parallel machines, sequence dependent setups and due dates. The problem is based on a real case and the objective is to minimise the sum of the makespan and the weighted delays. A mixed integer linear programming model is proposed and since the model considers realistic constraints, a metaheuristic based on GRASP is used as a solution method. Several versions of the metaheuristic are tested and multiple instances of the problem with different configurations are generated to test the solution quality and the computational performance.

Online publication date: Sun, 24-Jun-2007

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