Continuous Filling and Emptying of Storage Systems in constraint-­based Scheduling

Francis Sourd 1 Jérôme Rogerie
1 RO - Recherche Opérationnelle
LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : In constraint-based scheduling, storage systems are modeled by a class of resources called reservoirs. Activities can either produce a quantity of product to be stored in the reservoir or consume it, removing the quantity from the reservoir. Most of the models presented in the literature assume that the production and the consumption is instantaneous but it can be a very bad approximation for some problems, for example those dealing with tanks of fluid. This paper introduces the continuous reservoir model in which the activity fills or empties the reservoir at a constant rate from its start time to its end time. This model is generalized to deal with additional constraints, such that leaks or overflows, that cannot be modeled by activities. Timetabling, a classical technique for the propagation of resource constraints in constraint-based scheduling, is adapted and extended to this new model.
Document type :
Journal articles
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01185227
Contributor : Lip6 Publications <>
Submitted on : Wednesday, August 19, 2015 - 2:41:01 PM
Last modification on : Saturday, December 15, 2018 - 1:28:37 AM

Identifiers

Collections

Citation

Francis Sourd, Jérôme Rogerie. Continuous Filling and Emptying of Storage Systems in constraint-­based Scheduling. European Journal of Operational Research, Elsevier, 2005, 165 (2), pp.510-524. ⟨10.1016/j.ejor.2004.04.019⟩. ⟨hal-01185227⟩

Share

Metrics

Record views

82