The basic cyclic scheduling problem with deadlines.
Philippe ChrétiennePublished in: Discret. Appl. Math. (1991)
Keyphrases
- scheduling problem
- cyclic scheduling
- single machine
- np hard
- flowshop
- processing times
- tabu search
- response time
- precedence constraints
- minimizing makespan
- setup times
- contract algorithms
- parallel machines
- earliness tardiness
- release dates
- preventive maintenance
- permutation flowshop
- total tardiness
- data sets
- job shop scheduling problem
- list scheduling
- real time
- database transactions
- sequence dependent setup times
- limited capacity
- strongly np hard
- upper bound
- information systems
- database
- spectral density