An empirical analysis of the optimality rate of flow shop heuristics.
Pawel Jan KalczynskiJerzy KamburowskiPublished in: Eur. J. Oper. Res. (2009)
Keyphrases
- flowshop
- flowshop scheduling problems
- asymptotic optimality
- scheduling problem
- flowshop scheduling
- asymptotically optimal
- processing times
- special case
- tabu search
- integer linear programming formulation
- sequence dependent setup times
- maximum lateness
- np hard
- parallel machines
- open shop
- setup times
- genetic algorithm
- minimizing makespan
- optimal solution
- job shop
- precedence constraints
- lower bound
- neural network
- job shop scheduling problem
- buffer allocation
- single machine