An improved MIP-based approach to minimise total earliness and tardiness in unrelated parallel machines scheduling with machine idle time
by Chi-Yang Tsai; Yi-Chen Wang
International Journal of Manufacturing Technology and Management (IJMTM), Vol. 29, No. 5/6, 2015

Abstract: This paper proposes an effective and efficient mixed integer linear programming (MIP) formulation of the unrelated parallel machine scheduling problem with the objective of minimising total earliness and tardiness (ET) and explores how scheduling performance can be improved by allowing machine idle time. In addition, four simple dispatching rules are utilised to improve solution efficiency. From the results of experiments, it is found that: 1) the improved MIP formulation fixes a potential problem of existing models in literature; 2) the ET value can be significantly reduced if machine idle time is properly allowed before jobs; 3) the utilised dispatching rules yield comparable efficient and quality solutions.

Online publication date: Mon, 17-Aug-2015

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 Manufacturing Technology and Management (IJMTM):
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