Speeding-up heuristic allocation, scheduling and binding with SAT-based abstraction/refinement techniques.
Gianpiero CabodiLuciano LavagnoMarco MurcianoAlex KondratyevYosinori WatanabePublished in: ACM Trans. Design Autom. Electr. Syst. (2010)
Keyphrases
- resource allocation
- bounded model checking
- scheduling problem
- list scheduling
- quay crane
- instruction scheduling
- iterative repair
- allocate resources
- unrelated parallel machines
- container terminal
- capacity allocation
- scheduling algorithm
- optimal scheduling
- combinatorial optimization
- grid resource
- allocation strategies
- allocation strategy
- high level
- classical planning
- scheduling jobs
- optimal solution
- version space
- answer set programming
- constraint programming
- constraint satisfaction
- dynamic programming
- constraint solver
- scheduling policies
- parallel genetic algorithm
- parallel machines
- tabu search
- formal verification
- scheduling decisions
- job shop scheduling problem
- temporal logic
- metaheuristic
- orders of magnitude