Explaining Producer/Consumer Constraints

Resource-constrained project scheduling problems are one of the most studied scheduling problem, and constraint programming with nogood learning provides the state-of-the-art solving technology for them, at least when the aim is minimizing makespan. In this paper we examine the closely related problem of scheduling producers and consumers of discrete resources and reservoirs. Producer/consumer constraints model consumable resources, such as raw materials (e.g., water) and money, in which event times relate to a production or consumption event. In this paper, we investigate what is the most appropriate language of learning: should we learn about the event times for production and consumption, or should be instead learn about the temporal relationships between events? For this reason, we explore global constraint propagators with explanation for producer/consumer constraints and contrast this with simple decomposition approaches. Experiments on resource-constrained project scheduling problems involving producer/consumer constraints show that nogood learning solvers are highly effective at these problems.

[1]  Philippe Laborie,et al.  Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results , 2003, Artif. Intell..

[2]  Ian P. Gent Proceedings of the 15th international conference on Principles and practice of constraint programming , 2009 .

[3]  Klaus Neumann,et al.  Project scheduling with inventory constraints , 2003, Math. Methods Oper. Res..

[4]  Oded Maler,et al.  Fast and Flexible Difference Constraint Propagation for DPLL(T) , 2006, SAT.

[5]  Christian Bessiere,et al.  Proceedings of the 13th international conference on Principles and practice of constraint programming , 2007 .

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

[7]  Peter J. Stuckey,et al.  To Encode or to Propagate? The Best Choice for Each Constraint in SAT , 2013, CP.

[8]  Peter J. Stuckey,et al.  Propagation via lazy clause generation , 2009, Constraints.

[9]  Roman Barták Conceptual Models for Combined Planning and Scheduling , 2000, Electron. Notes Discret. Math..

[10]  Gilles Pesant,et al.  Principles and Practice of Constraint Programming , 2015, Lecture Notes in Computer Science.

[11]  Peter J. Stuckey,et al.  Global difference constraint propagation for finite domain solvers , 2008, PPDP.

[12]  Michele Lombardi,et al.  Integration of AI and OR Techniques in Constraint Programming: 12th International Conference, CPAIOR 2015, Barcelona, Spain, May 18-22, 2015, Proceedings , 2015, CPAIOR.

[13]  Peter J. Stuckey,et al.  Explaining the cumulative propagator , 2010, Constraints.

[14]  Rolf H. Möhring,et al.  A Constraint Integer Programming Approach for Resource-Constrained Project Scheduling , 2010, CPAIOR.

[15]  Peter J. Stuckey,et al.  Maximising the Net Present Value for Resource-Constrained Project Scheduling , 2012, CPAIOR.

[16]  Peter J. Stuckey,et al.  Efficient constraint propagation engines , 2006, TOPL.

[17]  V J Rayward-Smith Project Scheduling: Recent Models, Algorithms and Applications , 2001, J. Oper. Res. Soc..

[18]  Andrei Horbach,et al.  A Boolean satisfiability approach to the resource-constrained project scheduling problem , 2010, Ann. Oper. Res..

[19]  Peter J. Stuckey,et al.  Modeling and Solving Project Scheduling with Calendars , 2015, CP.

[20]  Mats Carlsson,et al.  A New Multi-resource cumulatives Constraint with Negative Heights , 2002, CP.

[21]  Helmut Simonis,et al.  Modelling Producer/Consumer Constraints , 1995, CP.

[22]  Richard F. Hartl,et al.  On the efficient modeling and solution of the multi-mode resource-constrained project scheduling problem with generalized precedence relations , 2016, OR Spectr..

[23]  J. Christopher Beck Heuristics for scheduling with inventory: dynamic focus via constraint criticality , 2002 .

[24]  Andreas Schutt,et al.  Modelling and Solving Multi-mode Resource-Constrained Project Scheduling , 2016, CP.

[25]  Joris Kinable A Reservoir Balancing Constraint with Applications to Bike-Sharing , 2016, CPAIOR.

[26]  K. Neumann,et al.  Methods for Resource-Constrained Project Scheduling with Regular and Nonregular Objective Functions and Schedule-Dependent Time Windows , 1999 .

[27]  Peter J. Stuckey,et al.  Solving RCPSP/max by lazy clause generation , 2012, Journal of Scheduling.

[28]  Peter J. Stuckey,et al.  Conflict Directed Lazy Decomposition , 2012, CP.