The permutation flowshop scheduling problem with exact time lags to minimise the total earliness and tardiness
by Imen Hamdi; Taïcir Loukil
International Journal of Operational Research (IJOR), Vol. 28, No. 1, 2017

Abstract: In this paper, we investigate the problem of n-jobs scheduling in an m-machine permutation flowshop with exact time lags between consecutive operations of each job. The exact time lag is defined as the time elapsed between every couple of successive operations of the same job which is equal to a prescribed value. The aim is to find a feasible schedule that minimises the total tardiness and earliness. We propose three mathematical formulations, which are then solved by running the commercial software CPLEX to provide an optimal solution for small size problems. As the problem is shown to be strongly NP-hard, we propose new improved upper and lower bounds useful for large size problems. We then evaluate their effectiveness through an extensive computational experiment.

Online publication date: Thu, 01-Dec-2016

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