A branch and bound algorithm to minimise the total tardiness in the two-machine permutation flowshop scheduling problem with minimal time lags

Imen Hamdi, Ammar Oulamara and Taïcir Loukil

International Journal of Operational Research, 2015, vol. 23, issue 4, 387-405

Abstract: In this paper, we consider the two-machine permutation flowshop scheduling problem with minimal time lags and the objective of minimising total tardiness. Dominance criteria are developed to establish precedence constraints between jobs in an optimal schedule and a lower bound on the total tardiness of the problem is derived. A branch and bound algorithm for this problem is developed to reach an optimal solution using lower bound and dominance criteria. Also, computationally efficient heuristics are proposed. Results of computational experiments on randomly generated problems are reported.

Keywords: two-machine scheduling; permutation flowshops; flowshop scheduling; time lags; total tardiness; branch and bound. (search for similar items in EconPapers)
Date: 2015
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.inderscience.com/link.php?id=70142 (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:23:y:2015:i:4:p:387-405

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 ().