A technical note: fully polynomial time approximation schemes for minimizing the makespan of deteriorating jobs with nonlinear processing times.
Nir HalmanPublished in: J. Sched. (2020)
Keyphrases
- processing times
- approximation schemes
- deteriorating jobs
- single machine
- approximation algorithms
- scheduling problem
- polynomially solvable
- release times
- single machine scheduling problem
- np hard
- release dates
- setup times
- special case
- scheduling jobs
- learning effect
- worst case
- sequence dependent setup times
- identical machines
- dynamic programming
- flowshop
- tabu search
- bin packing
- production scheduling
- completion times
- search algorithm
- resource consumption
- numerical methods