On the Complexity of a Periodic Scheduling Problem with Precedence Relations.
Richard HladíkAnna MinaevaZdenek HanzálekPublished in: COCOA (2020)
Keyphrases
- scheduling problem
- precedence relations
- precedence constraints
- processing times
- makespan minimization
- single machine
- sequence dependent setup times
- flowshop
- np hard
- parallel machines
- setup times
- single machine scheduling problem
- worst case
- release dates
- resource constrained project scheduling problem
- total weighted tardiness
- tabu search
- job shop
- computational complexity
- job shop scheduling problem
- space complexity
- benchmark problems
- particle swarm optimization
- special case