Solving Restricted Preemptive Scheduling on Parallel Machines with SAT and PMS.
Xiaojuan LiaoHui ZhangMiyuki KoshimuraRong HuangFagen LiPublished in: J. Univers. Comput. Sci. (2023)
Keyphrases
- parallel machines
- preemptive scheduling
- scheduling problem
- total tardiness
- unrelated parallel machines
- sequence dependent setup times
- stochastic local search
- parallel computing
- minimize total
- scheduling jobs
- sat solvers
- combinatorial optimization
- satisfiability problem
- sat encodings
- sat instances
- precedence constraints
- shared memory
- release dates
- flowshop
- setup times
- sat problem
- lot sizing
- search algorithm
- single server