MaxSAT Application for Vertical Transport Machine's Scheduling

Abstract

This paper considers optimal scheduling for a vertical transport machine. We propose a scheduling method with MaxSAT which is an optimal version of Boolean satisfiability problem (SAT). The movement of the luggage in the machine is described as a set of Boolean formulas, and those costs are represented by a set of weighted Boolean formulas. The MaxSAT solver finds out an optimal scheduling as a model satisfying the formulas with the minimum cost. Experimental results show that the proposed method can solve the practical problems in reasonable time. We succeeded to improve transport capacity by constructing the optimal table with MaxSAT.