Efficient mixed integer programming formulations and dispatching rules for parallel machine scheduling with allowing machine idle times
by Chi-Yang Tsai; Yi-Chen Wang
International Journal of Industrial and Systems Engineering (IJISE), Vol. 21, No. 3, 2015

Abstract: This paper proposes mixed integer programming formulations for the unrelated parallel-machines scheduling problem with allowing machine idle times given the objective of minimising the total earliness and tardiness. Experiment and analysis are conducted to gain insight into the effect of allowing machine idle time to job schedule performance. Simple dispatching rules are applied for better solution efficiency. Experiment results show that allowing machine idle times can be better utilised with job due dates are loose and the dispatching rules are very competitive for efficiency and quality of solutions.

Online publication date: Thu, 08-Oct-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 Industrial and Systems Engineering (IJISE):
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