An acyclic days-off scheduling problem.
Marie-Christine CostaFethi JarrayChristophe PicouleauPublished in: 4OR (2006)
Keyphrases
- scheduling problem
- np hard
- single machine
- flowshop
- tabu search
- database schemes
- lower bound
- processing times
- np complete
- total tardiness
- precedence constraints
- setup times
- special case
- parallel machines
- minimizing makespan
- earliness tardiness
- branch and bound algorithm
- approximation algorithms
- job shop scheduling problem
- unrelated parallel machines
- optimal solution
- preventive maintenance
- sequence dependent setup times
- list scheduling
- database
- quay crane
- permutation flowshop
- supply chain
- computational complexity
- search algorithm
- database systems
- genetic algorithm