Solving the Wastewater Treatment Plant Problem with SMT

In this paper we introduce the Wastewater Treatment Plant Problem, a real-world scheduling problem, and compare the performance of several tools on it. We show that, for a naive modeling, state-of-the-art SMT solvers outperform other tools ranging from mathematical programming to constraint programming. We use both real and randomly generated benchmarks. From this and similar results, we claim for the convenience of developing compiler front-ends being able to translate from constraint programming languages to the SMT-LIB standard language.

[1]  Erik Demeulemeester,et al.  An efficient optimal solution procedure for the preemptive resource-constrained project scheduling problem , 1996 .

[2]  Jacques Carlier,et al.  A new LP-based lower bound for the cumulative scheduling problem , 2000, Eur. J. Oper. Res..

[3]  Miquel Bofill Arasa,et al.  SIMPLY: a Compiler from a CSP Modeling Language to the SMT-LIB Format , 2009 .

[4]  Cesare Tinelli,et al.  Solving SAT and SAT Modulo Theories: From an abstract Davis--Putnam--Logemann--Loveland procedure to DPLL(T) , 2006, JACM.

[5]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[6]  Hilary Putnam,et al.  A Computing Procedure for Quantification Theory , 1960, JACM.

[7]  Dídac Busquets,et al.  Improving Water Quality by Coordinating Industries Schedules and Treatment Plants , 2007 .

[8]  Albert Oliveras,et al.  Challenges in Satisfiability Modulo Theories , 2007, RTA.

[9]  Nicolas Beldiceanu,et al.  Extending CHIP in order to solve complex scheduling and placement problems , 1993, JFPL.

[10]  Donald W. Loveland,et al.  A machine program for theorem-proving , 2011, CACM.

[11]  Albert Oliveras,et al.  On SAT Modulo Theories and Optimization Problems , 2006, SAT.

[12]  François Laburthe,et al.  Cumulative Scheduling with Task Intervals , 1996, JICSLP.

[13]  Peter J. Stuckey,et al.  MiniZinc: Towards a Standard CP Modelling Language , 2007, CP.

[14]  Warwick Harvey,et al.  Essence: A constraint language for specifying combinatorial problems , 2007, Constraints.

[15]  Richard C. Larson,et al.  Model Building in Mathematical Programming , 1979 .

[16]  Toby Walsh,et al.  CSPLIB: A Benchmark Library for Constraints , 1999, CP.

[17]  Bert De Reyck,et al.  DEPARTEMENT TOEGEPASTE ECONOMISCHE WETENSCHAPPEN PHASE TRANSITIONS IN PROJECT SCHEDULING , 2022 .

[18]  Philippe Baptiste,et al.  Satisfiability tests and time‐bound adjustmentsfor cumulative scheduling problems , 1999, Ann. Oper. Res..

[19]  Peter J. Stuckey,et al.  Why Cumulative Decomposition Is Not as Bad as It Sounds , 2009, CP.

[20]  Jan Karel Lenstra,et al.  Scheduling subject to resource constraints: classification and complexity , 1983, Discret. Appl. Math..

[21]  Peter Brucker,et al.  Complex Scheduling (GOR-Publications) , 2006 .

[22]  Erik Demeulemeester,et al.  Project scheduling : a research handbook , 2002 .