Squeezing branch and bound algorithm for the machine-fixed, machining-assembly flowshop scheduling problem.
Kazuko MorizawaXi SunHiroyuki NagasawaPublished in: Int. J. Manuf. Technol. Manag. (2003)
Keyphrases
- flowshop
- branch and bound algorithm
- scheduling problem
- np hard
- precedence constraints
- strongly np hard
- process planning
- lower bound
- minimizing total tardiness
- sequence dependent setup times
- single machine
- branch and bound
- optimal solution
- setup times
- flowshop scheduling
- processing times
- upper bound
- special case
- bicriteria
- minimizing makespan
- maximum lateness
- lower bounding
- permutation flowshop
- makespan minimization
- combinatorial optimization
- tabu search
- total tardiness
- flowshop scheduling problems
- shortest processing time
- lagrangian relaxation
- parallel machines
- approximation algorithms
- total weighted tardiness
- release dates
- single machine scheduling problem
- np complete
- total flowtime
- job shop scheduling problem
- linear programming
- fixed number
- job processing times
- evolutionary algorithm
- search algorithm
- production scheduling
- computational complexity
- unrelated parallel machines
- knapsack problem