The permutation flowshop scheduling problem with exact time lags to minimise the total earliness and tardiness

Imen Hamdi and Taïcir Loukil

International Journal of Operational Research, 2017, vol. 28, issue 1, 70-86

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.

Keywords: permutation flowshops; flowshop scheduling; exact time lags; tardiness; earliness; mathematical formulations; lower bounds; upper bounds. (search for similar items in EconPapers)
Date: 2017
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.inderscience.com/link.php?id=80596 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijores:v:28:y:2017:i:1:p:70-86

Access Statistics for this article

More articles in International Journal of Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().