Erratum to "A note on a greedy heuristic for flow-shop makespan minimization with no machine idle-time" [European Journal of Operational Research, 184 (2) (2008), 810-813].
Daniel BarazGur MosheiovPublished in: Eur. J. Oper. Res. (2009)
Keyphrases
- flowshop
- makespan minimization
- greedy heuristic
- scheduling problem
- np hard
- single machine
- processing times
- parallel machines
- setup times
- total weighted tardiness
- sequence dependent setup times
- np complete
- greedy algorithm
- special case
- lower bound
- optimal solution
- precedence constraints
- job processing times
- knapsack problem
- branch and bound algorithm
- approximation algorithms
- polynomially solvable
- job shop scheduling problem
- tabu search
- computational complexity
- linear programming
- integer programming
- job shop scheduling
- single machine scheduling problem
- minimum cost
- release dates
- upper bound
- worst case
- job shop
- multi objective
- completion times
- vehicle routing problem