A Novel SAT-Based Approach to the Task Graph Cost-Optimal Scheduling Problem.
Sergio NoccoStefano QuerPublished in: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. (2010)
Keyphrases
- scheduling problem
- expected cost
- np hard
- minimum cost
- optimal scheduling
- single machine
- dynamic programming
- worst case
- graph representation
- satisfiability problem
- total cost
- optimal solution
- graph structure
- tabu search
- parallel machines
- np complete
- orders of magnitude
- spanning tree
- optimal planning
- min sum
- search algorithm
- flowshop
- random walk
- setup times
- constant factor