A FPTAS for minimizing total completion time in a single machine time-dependent scheduling problem.
Krzysztof M. OcetkiewiczPublished in: Eur. J. Oper. Res. (2010)
Keyphrases
- single machine
- scheduling problem
- processing times
- maximum lateness
- earliness tardiness
- total tardiness
- flowshop
- total weighted tardiness
- minimize total
- release dates
- setup times
- sequence dependent setup times
- scheduling jobs
- np hard
- release times
- learning effect
- precedence constraints
- approximation algorithms
- parallel machines
- weighted tardiness
- tabu search
- minimizing makespan
- weighted number of tardy jobs
- competitive ratio
- production scheduling
- job shop scheduling
- job shop scheduling problem
- dynamic programming
- makespan minimization
- single machine scheduling problem
- multistage