A branch-and-bound algorithm for a two-machine flowshop scheduling problem with limited waiting time constraints.
Byung-Jun JooYeong-Dae KimPublished in: J. Oper. Res. Soc. (2009)
Keyphrases
- flowshop
- scheduling problem
- precedence constraints
- branch and bound algorithm
- np hard
- sequence dependent setup times
- strongly np hard
- minimizing total tardiness
- setup times
- single machine
- single machine scheduling problem
- processing times
- bicriteria
- minimizing makespan
- lower bound
- maximum lateness
- flowshop scheduling
- branch and bound
- parallel machines
- tabu search
- total tardiness
- makespan minimization
- optimal solution
- lower bounding
- release dates
- total weighted tardiness
- shortest processing time
- special case
- permutation flowshop
- lagrangian relaxation
- approximation algorithms
- job shop scheduling problem
- unrelated parallel machines
- upper bound
- np complete
- combinatorial optimization
- total flowtime
- genetic algorithm
- preventive maintenance
- flowshop scheduling problems
- identical parallel machines
- linear programming
- search space
- computational complexity
- search algorithm