Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

Heterogeneous Scheduling and Rotation

  • Chapter
  • First Online:
Computational Logic: Logic Programming and Beyond

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 2407))

  • 693 Accesses

Abstract

This article highlights an application in the area of decision support for planning transports in a railway company utilising constraint logic programming and a flexible design which has been successfully tested on real world data.

We discuss the problem formulation for the co-ordination of distinct sub-problems, the allocation of track resources to transports, the allocation of vehicles to transports, and the allocation of personnel to perform the transportation tasks in a railway company and the development of a heterogeneous constraint model which is usable also for other production planning problems.

Using constraints as the key technology, we discuss approaches to find interfacing principles to combine several solvers.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Aggoun, A., Beldiceanu, N.: Extending CHIP in Order to Solve Complex Scheduling and Placement Problems. In Mathematical Computer Modelling 17(7): pp. 57–73, Pergamon Press Ltd. 1993.

    Article  Google Scholar 

  2. Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows. Prentice Hall, 1993.

    Google Scholar 

  3. Applegate, D., Cook, W.: A Computational Study of the Job-Shop Scheduling Problem. In ORSA Journal of Computing, 3(2): 149–156, 1991.

    MATH  Google Scholar 

  4. Aronsson, M., Kreuger, P., Lindblom, S., Holmberg, P.: ACOOR Rapport 1-TUFF: Systemöversikt och arkitektur. SICS Technical Report T2000/06 (in Swedish)

    Google Scholar 

  5. Baker, K.R.: Introduction to Sequencing and Scheduling Wiley & Sons, 1974.

    Google Scholar 

  6. Baptiste, P., Pape, C.L.: A Theoretical and Experimental Comparison of Constraint Propagation Techniques for Disjunctive Scheduling. In the Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence Montreal, Quebec, pp. 400–606, 1995.

    Google Scholar 

  7. Baptiste, P., Le Pape, C., Nuijten, W.: Incorporating Efficient Operations Research Algorithms in Constraint Based Scheduling. In Proceedings of the First International Joint Workshop on Artificial Intelligence and Operations Research, Timberline Lodge, Oregon, 1995.

    Google Scholar 

  8. Beck, J.C., Fox, M.S.: Supply Chain Co-ordination via Mediated Constraint Relaxation. In Proceedings of the First Canadian Workshop on Distributed Artificial Intelligence, May 15 1994.

    Google Scholar 

  9. Beldiceanu, N., Contejean, E.: Introducing Global Constraints in CHIP. In Mathematical Computer Modelling 20(12): 97–123, Pergamon Press Ltd. 1994.

    Article  MATH  Google Scholar 

  10. Beldiceanu, N.: Global Constraints as Graph Properties on Structured Networks of Elementary Constraints of the Same Type. Research Report R:2000-01, SICS, 2000.

    Google Scholar 

  11. Bodin, L., Golden, B.: Classification in Vehicle Routing and Scheduling. Networks, 11(97–108), 1981.

    Google Scholar 

  12. Bianco, L., Ricciardelli, S., Rinaldi, G., Sassano, A.: Scheduling Tasks with Sequence-dependent Processing Times. In Naval Research Logistics 35:177–184, 1988.

    Article  MATH  MathSciNet  Google Scholar 

  13. Brucker, P., Thiele, O.: A Branch & Bound Method for the General-shop Problem with Sequence Dependent Setup-Times. In OR Spektrum, 18:145–161, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  14. Bussieck, M.R., Winter, T., Zimmermann, U.T.: Discrete Optimization in Public Rail Transport. In Mathematical Programming, 79:415–444, 1997.

    MathSciNet  Google Scholar 

  15. Caseau, Y., Laburthe, F.: Disjunctive Scheduling with Task Intervals. Technical Report 95-25, Laboratoire d’Informatique de l’Ecole Normale Supérieure LIENS, Département de Mathématiques ed d’Informatique, 45 rue d’Ulm, 75232 Paris Cedex 05, France, 1995.

    Google Scholar 

  16. Caseau, Y., Laburthe, F.: Improving Branch and Bound for Job-Shop Scheduling with Constraint Propagation. Technical Report, Laboratoire d’Informatique de l’Ecole Normale Supérieure LIENS, Département de Mathématiques ed d’Informatique, 45 rue d’Ulm, 75232 Paris Cedex 05, France, 1996.

    Google Scholar 

  17. Carlier, J., Pinson, E.: An Algorithm for Solving the Job-Shop Scheduling Problem. In Management Science 35(2): 164–176, 1989.

    MATH  MathSciNet  Google Scholar 

  18. Carlier, J., Pinson, E.: A Practical Use of Jackson’s Preemptive Schedule for Solving the Job-Shop Problem. In Annals of Operations Research, 26: 269–287, 1990.

    MATH  MathSciNet  Google Scholar 

  19. Carlier, J., Pinson, E.: Adjustments of Heads and Tails for the Job-Shop Scheduling Problem. In the European Journal of Operational Research, 78:146–161, 1994.

    Article  MATH  Google Scholar 

  20. Carlsson, M. et. al: SICStus Programming Manual at http://www.sics.se/sicstus.html

  21. Cheng, A.B.M.W., Lee, J.H.M., Wu, J.C.K.: Speeding up Constraint Propagation by Redundant Modeling. In Second International Conference on Principles and Practice of Constraint Programming CP’96, volume 1118 of LNCS, pp. 91–103, Cambridge, Massachusetts, USA, Aug 1996. Springer-Verlag. Available in http://www.cse.cuhk.edu.hk/~isl/dPub2.html#Li.

    Google Scholar 

  22. Cordeau, J.-F., Toth, P., Vigo, D.: A Survey of Optimization Models for Train Routing and Scheduling. In Transportation Science, Nov 1998.

    Google Scholar 

  23. Dalfiume, A., Lamma, E., Mello, P., Milano, M.: A Constraint Logic Programming Application to a Distributed Train Scheduling Problem. In Proceedings of the conference on the practical applications of prolog, pp. 163–182, 1995.

    Google Scholar 

  24. Desrosiers, J., Soumis, F., Desrochers, M.: Routing With Time Windows by Column Generation. Networks, 14:545–565, 1984.

    Article  MATH  Google Scholar 

  25. Drott, J., Hasselberg, E., Kohl, N., Kremer, M.: A Planning System for Locomotive Scheduling. Technical Report, Swedish State Railways, Stab Tågplanering, Stockholm, Sweden and Carmen Systems AB, Jul 1997.

    Google Scholar 

  26. Fox, M.S., Sadeh, N.: Why Is Scheduling Difficult? In Proceedings of the European Conference on Artificial Intelligence, pp. 754–765, 1990.

    Google Scholar 

  27. Golden, B.L., Assad, A.A.: Vehicle Routing with Time-Window Constraints: Algorithmic Solutions. American Journal of Mathematical and Management Sciences, 6, 1986.

    Google Scholar 

  28. Gosselin, V.: Train Scheduling Using Constraint Programming Techniques. In 13th Conference on AI, Expert Systems and Natural Language, Avignon, 1993.

    Google Scholar 

  29. Haridi, S., Van Roy, P., Brand, P., Schulte, C.: Programming Languages for Distributed Applications. Invited paper in New Generation Computing, Vol. 16, No. 3, pp. 223–261, 1998. Ohmsa Ltd. and Springer-Verlag., Tokyo.

    Google Scholar 

  30. Haridi, S., Van Roy, P., Brand, P., Schulte, C., et.al.: http://www.mozart-oz.org/.

  31. Van Hentenryck, P.: Constraint Satisfaction in Logic Programming. Programming Logic Series. The MIT Press, Cambridge, MA, 1989.

    Google Scholar 

  32. Holmberg, P.: The Use of Abstractions to Solve Large Scheduling Problems. M. Sc. Thesis. KTH, The Royal Institute of Technology, Stockholm, Sweden, 2000.

    Google Scholar 

  33. Holte, R.C., Mkadmi, T., Zimmer, R.M., MacDonald, A.J.: Speeding Up Problem Solving by Abstraction: A Graph Oriented Approach. Artificial Intelligence, 85:321–361, 1996.

    Article  Google Scholar 

  34. Holte, R.C., Perez, M.B., Zimmer, A.J., MacDonald, R.M.: Hierarchical a*: Searching Abstraction Hierarchies Efficiently. 1995.

    Google Scholar 

  35. Jordan, C., Drex, A.L.: A Comparison of Constraint and Mixed-integer Programming Solvers for Batch Sequencing with Sequence-dependent Setups. In ORSA Journal on Computing 7: 160–165, 1995.

    MATH  Google Scholar 

  36. Kreuger, P., Aronsson, M., Holmberg, P., Lindblom, S.: ACOOR Rapport 2-Oversikt av tekniker och metoder. SICS Technical Report T2000/07 (in Swedish)

    Google Scholar 

  37. Kreuger, P., Aronsson, M., Lindblom, S.: Task Structure Abstraction. SICS Technical Report T2001:05

    Google Scholar 

  38. Kreuger, P., Carlsson, M., Sjöland, T., Åström, E.: Sequence dependent task extensions for trip scheduling. SICS Technical report T2001:14.

    Google Scholar 

  39. Kreuger, P., Carlsson, M., Olsson, J., Sjöland, T., Åström, E.: The TUFF Train Scheduler-Trip Scheduling on Single Track Networks. In The Proceedings of the Workshop on Industrial Constraint-Directed Scheduling, at the Third International Conference on Principles and Practice of Constraint Programming, Schloß Hagenberg, Linz, Austria, 1997. Davenport, A. (ed.).

    Google Scholar 

  40. Lockett, A.G., Muhlemann, A.P.: A Scheduling Problem Involving Sequence Dependent Changeover Times. In Operations Research 20: 895–902, 1972.

    Google Scholar 

  41. Löbel, A.: Optimal Vehicle Scheduling in Public Transit. Ph. D. thesis, TU Berlin, 1998. Shaker-Verlag, Aachen.

    Google Scholar 

  42. Martin, C.: Logistics and Supply Chain Management Financial Times Pitman Publishing, 1992

    Google Scholar 

  43. Müller, M., Popov, K., Schulte, C, Würtz, J.: Constraint Programming in Oz. DFKI, Saarbrücken, Germany, 1995

    Google Scholar 

  44. Müller, M., Würtz, J.: Finite Domain Programming in Oz. DFKI, Saarbrücken, Germany, 1995.

    Google Scholar 

  45. Oliveira, E., Smith, B.M.: A Job-Shop Scheduling Model for the Single-Track Railway Scheduling Problem University of Leeds, UK, 2000.

    Google Scholar 

  46. Potvin, J.-Y., Rousseau, J.-M.: A Parallel Route Building Algorithm for the Vehicle Routing and Scheduling Problem with Time Windows. European Journal of Operational Research, 66:331–340, 1993.

    Article  MATH  Google Scholar 

  47. Reeves, C., (ed.). Modern Heuristic Techniques for Combinatorial Optimization. McGraw-Hill International (UK) Ltd., 1995.

    Google Scholar 

  48. Ribeiro, C.C., Soumis, F.: A Column Generation Approach to the Multiple-Depot Vehicle Scheduling Problem. Operations Research, 42(1):41–52, 1994.

    MATH  Google Scholar 

  49. Rossi, F., et.al.: Constraint Logic Programming (a survey). In J. Siekmann, (ed.) Proc. of the ERCIM Working Group on Constraints /Compulog Net Area on Constraint Programming Workshop, Cyprus. LNAI, oct 1999. Springer-Verlag.

    Google Scholar 

  50. Saraswat, V.A.: Concurrent Constraint Programming Languages. Ph.D. Thesis 1989, MIT Press, 1993.

    Google Scholar 

  51. Savelsbergh, M.W.P.: Local Search in Routing Problems with Time Windows. Annals of Operations Research, 4:285–305, 1985.

    Article  MathSciNet  Google Scholar 

  52. Scholtz, V.: Knowledge-Based Locomotive Planning for the Swedish Railway. Master’s Thesis, Institut für Informatik, Universität Stuttgart and Swedish Institute of Computer Science (SICS), Nov 1998. ISRN: SICS-T-2000/05-SE.

    Google Scholar 

  53. Simonis, H.: A Problem Classification Scheme for Finite Domain Constraint Solving. In CP’96 Applications Workshop, COSYTEC SA, Orsay, France.

    Google Scholar 

  54. Simonis, H.: Calculating Lower Bounds on a Resource Scheduling Problem. In Proceedings of the Workshop on Applications at the International Conference of Constraint Programming CP’96, 1996.

    Google Scholar 

  55. Simonis, H.: Modeling Machine Set-up Time in CHIP. In Proceedings of the Workshop on Applications at the International Conference of Constraint Programming CP’96, 1996.

    Google Scholar 

  56. So, K.T.: Some Heuristics for Scheduling Jobs on Parallel Machines with Setups In Management Science 36: 467–475, 1990.

    MATH  MathSciNet  Google Scholar 

  57. Solomon, M.M.: On the Worst-case Performance of Some Heuristics for the Vehicle Routing and Scheduling Problem with Time Window Constraints. Networks, 16:161–174, 1986.

    Article  MATH  MathSciNet  Google Scholar 

  58. Solomon, M.M.: Algorithms for the Vehicle Routing and Scheduling Problem with Time Window Constraints. Operations Research, 35(2):254–265, March–April 1987.

    Google Scholar 

  59. Solomon, M.M., Desrosiers, J.: Time Window Constrained Routing and Scheduling Problems. Transportation Science, 22(1):1–13, 1988.

    Article  MATH  MathSciNet  Google Scholar 

  60. Thompson, P.M., Psaraftis, H.N.: Cyclic Transfer Algorithms for Multi-Vehicle Routing and Scheduling Problems. Operations Research, 41(5):935–946, 1993.

    MATH  MathSciNet  Google Scholar 

  61. Tsang, E.: Foundations of Constraint Satisfaction. Academic Press, 1993.

    Google Scholar 

  62. White, C.H., Wilson, R.C.: Sequence Dependent Set-up Times and Job Sequencing. International Journal of Production Research 15, pp. 191–202, 1977.

    Article  Google Scholar 

  63. Yang, Q.: Intelligent Planning-A Decomposition and Abstraction Based Approach. ISBN 3-540-61901-1. Springer-Verlag, Berlin, 1997.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. SICS, The Swedish Institute of Computer Science AB, Sweden

    Thomas Sjöland, Per Kreuger & Martin Aronsson

  2. IMIT/KTH, The Royal Institute of Technology, Kista, Sweden

    Thomas Sjöland

Authors
  1. Thomas Sjöland
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Per Kreuger
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Martin Aronsson
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Cyprus, 75 Kallipoleos St., 1678, Nicosia, Cyprus

    Antonis C. Kakas

  2. Department of Computing, Imperial College of Science, Technology and Medicine, 180 Queen’s Gate, London, SW7 2BZ, UK

    Fariba Sadri

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Sjöland, T., Kreuger, P., Aronsson, M. (2002). Heterogeneous Scheduling and Rotation. In: Kakas, A.C., Sadri, F. (eds) Computational Logic: Logic Programming and Beyond. Lecture Notes in Computer Science(), vol 2407. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45628-7_24

Download citation

  • DOI: https://doi.org/10.1007/3-540-45628-7_24

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43959-2

  • Online ISBN: 978-3-540-45628-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation