A branch and bound algorithm to minimise the total tardiness in the two-machine permutation flowshop scheduling problem with minimal time lags (Q2627602)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch and bound algorithm to minimise the total tardiness in the two-machine permutation flowshop scheduling problem with minimal time lags |
scientific article |
Statements
A branch and bound algorithm to minimise the total tardiness in the two-machine permutation flowshop scheduling problem with minimal time lags (English)
0 references
31 May 2017
0 references
Summary: 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.
0 references
two-machine scheduling
0 references
permutation flowshops
0 references
flowshop scheduling
0 references
time lags
0 references
total tardiness
0 references
branch and bound
0 references
