Approximation schemes for scheduling on a single machine subject to cumulative deterioration and maintenance.
Hans KellererKabir RustogiVitaly A. StrusevichPublished in: J. Sched. (2013)
Keyphrases
- single machine
- approximation schemes
- scheduling problem
- deteriorating jobs
- release dates
- minimize total
- maximum lateness
- release times
- scheduling jobs
- weighted tardiness
- approximation algorithms
- sequence dependent setup times
- processing times
- total weighted tardiness
- earliness tardiness
- identical machines
- total tardiness
- np hard
- setup times
- production scheduling
- learning effect
- parallel machines
- precedence constraints
- weighted number of tardy jobs
- rolling horizon
- flowshop
- job processing times
- numerical methods
- single machine scheduling problem
- competitive ratio
- dynamic programming
- job shop scheduling
- number of late jobs
- production system
- tabu search
- worst case
- job shop
- special case