A Scalable Method for a Particular Scheduling Problem Based on Boolean Satisfiability

DOI

10.2991/asei-15.2015.209How to use a DOI?

Keywords

Boolean satisfiability, scheduling, SAT solving

Abstract

In recent years, people made a lot of progress for solving Boolean satisfiability problem. Existing solvers have been successful in dealing with problems with thousands of Boolean variables in reasonable amount of time. And there is a trend to use Boolean satisfiability solvers to deal with practical problems. In this paper, we investigate a method for reducing a particular type of scheduling problem to Boolean satisfiability. Hence we are able to use existing solvers to solve practical scheduling problems and get good performance.

Copyright

© 2015, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Hai Lin
PY  - 2015/05
DA  - 2015/05
TI  - A Scalable Method for a Particular Scheduling Problem Based on Boolean Satisfiability
BT  - Proceedings of the 2015 International conference on Applied Science and Engineering Innovation
PB  - Atlantis Press
SP  - 1064
EP  - 1067
SN  - 2352-5401
UR  - https://doi.org/10.2991/asei-15.2015.209
DO  - 10.2991/asei-15.2015.209
ID  - Lin2015/05
ER  -