Solving the single-machine sequencing problem using integer programming.
Kenneth R. BakerBrian KellerPublished in: Comput. Ind. Eng. (2010)
Keyphrases
- integer programming
- single machine
- total weighted tardiness
- lagrangian relaxation
- scheduling problem
- np hard
- integer program
- processing times
- minimize total
- sequence dependent setup times
- earliness tardiness
- linear programming
- maximum lateness
- lp relaxation
- release dates
- column generation
- network flow
- constraint programming
- dynamic programming
- valid inequalities
- release times
- cutting plane
- scheduling jobs
- setup times
- set partitioning
- weighted number of tardy jobs
- production planning
- cutting plane algorithm
- flowshop
- np complete
- number of late jobs
- lower bound
- precedence constraints
- approximation algorithms
- combinatorial optimization
- multistage
- particle swarm optimization
- special case