A branch and bound algorithm to minimise the total tardiness in the two-machine permutation flowshop scheduling problem with minimal time lags Online publication date: Sun, 28-Jun-2015
by Imen Hamdi; Ammar Oulamara; Taïcir Loukil
International Journal of Operational Research (IJOR), Vol. 23, No. 4, 2015
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.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
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:
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