Solving Assembly Scheduling Problems With Tree-Structure Precedence Constraints: A Lagrangian Relaxation Approach.
Jingyang XuRakesh NagiPublished in: IEEE Trans Autom. Sci. Eng. (2013)
Keyphrases
- precedence constraints
- tree structure
- lagrangian relaxation
- scheduling problem
- branch and bound algorithm
- setup times
- np hard
- precedence relations
- single machine scheduling problem
- combinatorial optimization
- total weighted tardiness
- lower bound
- sequence dependent setup times
- single machine
- data structure
- branch and bound
- maximum lateness
- release dates
- processing times
- parallel processors
- lagrangian dual
- feasible solution
- optimal solution
- flowshop
- frequent patterns
- parallel machines
- approximation algorithms
- tabu search
- xml documents
- upper bound
- np complete
- index structure
- dynamic programming
- job shop
- metaheuristic
- lower and upper bounds
- linear programming
- simulated annealing
- data mining
- search algorithm
- special case
- worst case
- column generation
- integer programming