On Undecidability of Cyclic Scheduling Problems.
Grzegorz BocewiczRobert WójcikZbigniew Antoni BanaszakPublished in: KSEM (2009)
Keyphrases
- scheduling problem
- cyclic scheduling
- single machine
- flowshop
- np hard
- description logics
- processing times
- tabu search
- job shop scheduling
- setup times
- job shop scheduling problem
- precedence constraints
- probabilistic planning
- parallel machines
- limited capacity
- greedy heuristics
- special case
- answering queries
- query containment
- job shop
- list scheduling