An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints.
Cherif SadfiBernard PenzChristophe RapineJacek BlazewiczPiotr FormanowiczPublished in: Eur. J. Oper. Res. (2005)
Keyphrases
- single machine
- scheduling problem
- total weighted tardiness
- high multiplicity
- competitive ratio
- np hard
- dynamic programming
- processing times
- earliness tardiness
- setup times
- sequence dependent setup times
- makespan minimization
- computational complexity
- optimal solution
- total tardiness
- maximum lateness
- release times
- minimize total
- lower and upper bounds
- single machine scheduling problem
- learning algorithm
- parallel machines
- flowshop
- job shop scheduling problem
- ant colony optimization
- job processing times
- precedence constraints
- strongly np hard
- hybrid algorithm
- linear programming
- objective function
- reinforcement learning