Lopez, P., J. Erschler and P. Esquirol. 1992. Ordonnancement de taches sous contraintes: une approche 'energ'etique. RAIRO Automatique, Productique, Informatique Industrielle 26, 453--481. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Constraint Propagation Techniques for Cumulative Scheduling - Baptiste, Le Pape (1998) (1 citation) (Correct)
....any time. This is of great interest because very efficient constraint propagation algorithms have been built for preemptive resource constraints of capacity one ( 1] The resulting algorithm runs in O(n 2 ) 3 Energetic Reasoning We reuse the notion of required energy consumption defined in [5]. The required energy consumption of an activity A i over an interval [t 1 t2 ] is c i times a lower bound of the number of time units during which A i executes over [t 1 t2 ] We use two lower bounds the first one is max(0; p i Gamma max(0; t1 Gamma r i ) Gamma max(0; d i Gamma t2 ) while ....
P. Lopez, J. Erschler and P. Esquirol. Ordonnancement de taches sous contraintes : une approche 'energ'etique. RAIRO Automatique, Productique, Informatique Industrielle 26 pp. 453--481, 1992.
A Branch-and-Bound Algorithm for the.. - Dorndorf, Pesch.. (Correct)
No context found.
Lopez, P., J. Erschler and P. Esquirol. 1992. Ordonnancement de taches sous contraintes: une approche 'energ'etique. RAIRO Automatique, Productique, Informatique Industrielle 26, 453--481.
Lower bounds for the Multi-Skill Project Scheduling Problem.. - Bellenguez, Neron (Correct)
No context found.
Lopez P., Erschler J. and Esquirol P., Ordonnancement de Taches sous Contraintes : une Approche Energetique, R.A.I.R.O.-A.P.I.I., 26(1992): 453-481.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC