A note on a greedy heuristic for flow-shop makespan minimization with no machine idle-time.
Daniel BarazGur MosheiovPublished in: Eur. J. Oper. Res. (2008)
Keyphrases
- flowshop
- makespan minimization
- greedy heuristic
- scheduling problem
- np hard
- single machine
- processing times
- setup times
- sequence dependent setup times
- parallel machines
- special case
- total weighted tardiness
- greedy algorithm
- np complete
- tabu search
- job shop
- optimal solution
- approximation algorithms
- knapsack problem
- precedence constraints
- polynomially solvable
- lower bound
- integer programming
- job shop scheduling problem
- branch and bound algorithm
- linear programming
- job processing times
- job shop scheduling
- minimum cost
- single machine scheduling problem
- worst case
- lagrangian relaxation
- computational complexity