A note on makespan minimization in proportionate flow shops.
Byung-Cheon ChoiJoseph Y.-T. LeungMichael L. PinedoPublished in: Inf. Process. Lett. (2010)
Keyphrases
- makespan minimization
- scheduling problem
- parallel machines
- job shop scheduling problem
- processing times
- special case
- metaheuristic
- polynomial time approximation
- polynomially solvable
- single machine
- flowshop
- total weighted tardiness
- setup times
- release dates
- np complete
- np hard
- job shop scheduling
- tabu search
- sequence dependent setup times
- combinatorial optimization problems
- single machine scheduling problem
- combinatorial optimization
- simulated annealing
- genetic algorithm
- production scheduling
- optimal solution
- lagrangian relaxation
- benchmark problems
- error bounds
- optimization problems
- approximation algorithms
- feasible solution
- mathematical model
- linear programming