Abstract
Interval capacity consistency tests consider the resource capacities available and required within certain time intervals. The goal of the tests is to draw conclusions that allow to rule out inadmissible activity start times or sequences. The tests can be effectively used to reduce the search space of difficult time- and resource-constrained scheduling problems. They have successfully been applied in algorithms for solving idealised problems such as the classical job shop scheduling problem (JSP) or the resource-constrained project scheduling problem (RCPSP) as well as for solving industrial scheduling problems. For instance, it seems fair to say that the advances in modern branch and bound algorithms for the JSP that have been made in the last decade can to a large extent be attributed to the effect of interval consistency tests, some of which are also known under the names of immediate selection, edge finding, and energetic reasoning. The tests can also serve to derive tight lower bounds for makespan minimisation problems.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aggoun, A. and N. Beldiceanu. 1993. Extending CHIP in Order to Solve Complex Scheduling and Placement Problems. Mathematical and Computer Modelling 17, 57–73.
Applegate, D. and W. Cook. 1991. A Computational Study of the Job-Shop Scheduling Problem. ORSA Journal on Computing 3,149–156.
Baptiste, P. and C. Le Pape. 1995. A Theoretical and Experimental Comparison of Constraint Propagation Techniques for Disjunctive Scheduling. In Proceedings of the l4th International Joint Conference on Artificial Intelligence. Montreal.
Baptiste, P. AND C. Le Pape. 1996. Edge-finding Constraint Propagation Algorithms for Disjunctive and Cumulative Scheduling. In Proceedings of the 15th Workshop of the U.K. Planning Special Interest Group. Liverpool, UK.
Baptiste, P., C. Le Pape and W. P. Nuuten}. 1998. Satisfiability Tests and Time-Bound Adjustments for Cumulative Scheduling Problems. Research report, Univer-sité de Technologie de Compiègne.
Bartusch, M., R. Möhring And F. Radermacher. 1988. Scheduling Project Networks with Resource Constraints and Time windows. Annals of Operations Research 16, 201–240.
Błażewicz, J., W. Domschke and E. Pesch. 1996a. The Job Shop Scheduling Problem: Conventional and New Solution Techniques. European Journal of Operational Research 93, 1–33.
Błażewicz, J., K. H. Ecker, E. Pesch, G. Schmidt and J. Węglarz. 1996b. Scheduling Computer and Manufacturing Processes. Springer, Berlin.
Błażewicz, J., E. Pesch and M. Sterna. 1997. Application of Modified Disjunctive Graphs for Job Shop Scheduling Problems. Working paper.
Błażewicz, J., E. Pesch and M. Sterna. 1998. A Branch and Bound Algorithm for the Job shop Scheduling Problem. In Beyond Manufacturing Resource Planning (MRP II), A. Drexl and A. Kimms, eds. Springer, Berlin. To appear.
Brucker, P., A. Drexl, R. Möhring, K. Neumann and E. Pesch. 1998. Resource-Constrained Project Scheduling: Notation, Classification, Models, and Methods. Working paper.
Brucker, P., B. Jurisch and A. Krämer. 1996a. The Job-Shop Problem and Immediate Selection. Annals of Operations Research 50, 73–114.
Brucker, P., A. Schoo and O. Thiele. 1996b. A Branch and Bound Algorithm for the Resource-Constrained Project Scheduling Problem. Osnabrücker Schriften zur Mathematik 178, Universität Osnabrück.
Carlier, J. 1982. The One-Machine Sequencing Problem. European Journal of Operational Research 11,42–47.
Carlier, J. And E. Plnson. 1989. An Algorithm for Solving the Job-Shop Problem. Management Science 35, 164–176.
Carlier, J. And E. Plnson. 1990. A Practical Use of Jackson’s Preemptive Schedule for the Job Shop Problem. Annals of Operations Research 26,269–287.
Carlier, J. And E. Plnson. 1994. Adjustments of Heads and Tails for the Job-Shop Problem. European Journal of Operational Research 78, 146–161.
Caseau, Y. And F. Laburthe. 1994. Improved CLP Scheduling with Task Intervals. In Proceedings of the 11th International Conference on Logic Programming, P. van Hentenryck, ed. MIT-Press.
Caseau, Y. and F. Laburthe. 1995. Disjunctive Scheduling with Task Intervals. Tech. Rep. 95-25, Laboratoire d’Informatique de l’Ecole Normale Supérieure Paris.
Caseau, Y. and F. Laburthe. 1996. Cumulative Scheduling with Task Intervals. In Proceedings of the Joint International Conference on Logic Programming. MIT-Press.
Domschke, W. And A. Drexl. 1991. Kapazitätsplanung in Netzwerken: Ein Überblick über neuere Modelle und Verfahren. OR Spektrum 13, 63–76.
Fisher, H. and G. Thompson. 1963. Probabilistic Learning Combinations of Local Job-Shop Scheduling Rules. In Industrial Scheduling, J. Muth and G. Thompson, eds. Prentice-Hall, Englewood Cliffs, NF.
Heilmann, R. and C. Schwindt. 1997. Lower Bounds for RCPSP/max. Tech. Rep. WIOR-511, Institut für Wirtschaftstheorie und Operations Research, Univer-sität Karlsruhe.
Jackson, J. 1956. An Extension of Johnson’s Results on Job Lot Scheduling. Naval Research Logistics Quarterly 3, 201–203.
Klein, R. And A. Scholl. 1997. Computing Lower Bounds by Destructive Improvement — an Application to Resource-Constrained Project Scheduling. Schriften zur Quantitativen Betriebswirtschaftslehre 4/97, Technische Hochschule Darmstadt.
Kolisch, R., A. Sprecher And A. Drexl. 1995. Characterization and Generation of a General Class of Resource-constrained Project Scheduling Problems. Management Science 41, 1693–1703.
Kumar, V. 1992. Algorithms for Constraint-Satisfaction Problems: A Survey. A.I. Magazine 13, 32–44.
Le Pape, C. 1994. Implementation of Resource Constraints in ILOG SCHEDULE: A Library for the Development of Constraint-Based Scheduling Systems. Intelligent Systems Engineering 3, 55–66.
Le Pape, C. 1995. Three Mechanisms for Managing Resource Constraints in a Library for Constraint-Based Scheduling. In Proceedings of the INRIA/IEEE Conference on Emerging Technologies and Factory Automation. Paris.
Le Pape, C. And P. Baptiste. 1996. A Constraint Programming Library for Preemptive and Non-Preemptive Scheduling. In Proceedings of the 12th European Conference on Aritificial Intelligence.
Lopez, P. 1991. Aproche énergétique pour I’ordonnancement de tâches sous con-traintes te temps et de ressources. Ph.D. thesis, Universite Paul Sabatier, Toulouse. Cited after Lopez et al. 1992.
Lopez, P., J. Erschler and P. Esquirol. 1992. Ordonnancement de tâches sous contraintes: une approche énergétique. RAIRO Automatique, Productique, Informa-tique Industrielle 26, 453–481.
Martin, P. AND D. B. Shmoys. 1996. A New Approach to Computing Optimal Schedules for the Job-Shop Scheduling Problem. In Proceedings of the 5th International IPCO Conference.
Nuijten, W. P. 1994. Time and Resource Constrained Scheduling: A Constraint Satisfaction Approach. Ph.D. thesis, Eindhoven University of Technology.
Nuijten, W. P. And E. Aarts. 1996. A Computational Study of Constraint Satisfaction for Multiple Capacitated Job-Shop Scheduling. European Journal of Operational Research 90,269–284.
Nuijten, W. P. And C. Le Pape. 1998. Constraint-based Job Shop Scheduling with Ilog Scheduler. Journal of Heuristics 3, 271–286.
Pesch, E. and U. Tetzlaff. 1996. Constraint Propagation Based Scheduling of Job Shops. INFORMS Journal on Computing 8, 144–157.
Schwindt, C. 1997. Verfahren zur Lö’sung des Ressourcenbeschränkten Pro-jekt-dauerminimierungsproblems mit Planungsabhängigen Zeitfenstern. Ph.D. thesis, Universität Fridericiana zu Karlsruhe.
Tsang, E. 1993. Foundations of Constraint Satisfaction. Academic Press, London.
Van Hentenryck, P. 1989. Constraint Satisfaction in Logic Programming. Logic Programming Series. MIT Press, Cambridge, MA.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer Science+Business Media New York
About this chapter
Cite this chapter
Dorndorf, U., Huy, T.P., Pesch, E. (1999). A Survey of Interval Capacity Consistency Tests for Time- and Resource-Constrained Scheduling. In: Węglarz, J. (eds) Project Scheduling. International Series in Operations Research & Management Science, vol 14. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-5533-9_10
Download citation
DOI: https://doi.org/10.1007/978-1-4615-5533-9_10
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-7529-6
Online ISBN: 978-1-4615-5533-9
eBook Packages: Springer Book Archive