Skip to main content
SpringerLink
Log in

A Generic Model and Hybrid Algorithm for Hoist Scheduling Problems

  • Conference paper
  • First Online:
Principles and Practice of Constraint Programming — CP98 (CP 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1520))

Abstract

This paper presents a robust approach to solve Hoist Scheduling Problems (HSPs) based on an integration of Constraint Logic Programming (CLP) and Mixed Integer Programming (MIP). By contrast with previous dedicated models and algorithms for solving classes of HSPs, we define only one model and run different solvers

The robust approach is achieved by using a CLP formalism. We show that our models for different classes of industrial HSPs are all based on the same generic model. In our hybrid algorithm search is separated from the handling of constraints. Constraint handling is performed by constraint propagation and linear constraint solving. Search is applied by labelling of boolean and integer variables

Computational experience shows that the hybrid algorithm, combining CLP and MIP solvers, solves classes of HSPs which cannot be handled by previous dedicated algorithms. For example, the hybrid algorithm derives an optimal solution, and proves its optimality, for multiple-hoists scheduling problems.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Barth, P., Bockmayr, A.: Modelling Mixed-Integer Optimisation Problems in Constraint Logic Programming. MPI Report Nr. I-95-2-011 (1995)

    Google Scholar 

  2. Baptiste, P., Legeard, B., Manier, M.A., Varnier, C.: A Scheduling Problem Optimisation Solved with Constraint Logic Programming. Proc. of the PACT Conf. (1994) 47–66

    Google Scholar 

  3. Beringer, H., De Backer, B.: Combinatorial Problem Solving in Constraint Logic Programming with Cooperating Solvers. Chapter 8 in Logic Programming: Formal Methods and Practical Applications ed. C. Beierle and L. Pluemer Elsevier (1995)

    Google Scholar 

  4. Cheng, C.C., Smith, S.F.: A Constraint Satisfaction Approach to Makespan Scheduling. Proc. of the AIPS Conf. (1996) 45–52

    Google Scholar 

  5. Dincbas, M., Van Hentenryck, P., Simonis, H., Aggoun, A., Graf, T., Berthier, F.: The Constraint Logic Programming Language CHIP. Proc. of the FGCS Conf. (1988) 693–702

    Google Scholar 

  6. CPLEX. Using the CPLEX Callable Library. CPLEX Optimization, Inc. (1997)

    Google Scholar 

  7. Dincbas, M., Simonis, H., Van Hentenryck, P.: Solving Large Combinatorial Problems in Logic Programming. Journal of Logic programming 8 (1995) 75–93

    Article  Google Scholar 

  8. Darby-Dowman, K., Little, J., Mitra, G., Zaffalon, M.: Constraint Logic Programming and Integer programming Approaches and their Collaboration in Solving an Assignment Scheduling Problem. Constraints 1(3) (1997) 245–264

    Article  MATH  MathSciNet  Google Scholar 

  9. ECLiPSe User Manual Version 3.7.1. IC-PARC, Imperial College, London (1998)

    Google Scholar 

  10. Hanen. C.: Study of a NP-Hard Cyclic Scheduling Problem: The Recurrent Job-Shop. European Journal of Operations Research 72 (1994) 82–101

    Article  MATH  Google Scholar 

  11. Hooker, J.N., Osorio, M.A.: Mixed Logical/Linear Programming. Proc. of the INFORMS CSTS Conf. Atlanta (1996)

    Google Scholar 

  12. Hajian, M., Sakkout, H.El, Wallace, M., Richards, E.: Towards a Closer Integration of Finite Domain Propagation and Simplex-Based Algorithms. Proc. of the AI Maths Conf. Florida (1995) http://www.icparc.ic.ac.uk/papers.html

  13. Jaffar, J., Lassez, J.L.: Constraint Logic Programming. Proc. of the ACM POPL Symposium Munich (1997)

    Google Scholar 

  14. Lei, L., Armstrong, R., Gu, S.: Minimizing the Fleet Size with Dependent Time-Window and Single-Track Constraints. Operations Res. Letters 14 (1993) 91–98

    Article  MATH  Google Scholar 

  15. Lei, L., Wang, T.J.: The Minimum Common-Cycle Algorithm for Cycle Scheduling of Two Material Handling Hoists with Time Window Constraints. Management Science 37(12) (1991) 1629–1639

    Article  MATH  Google Scholar 

  16. Lei, L., Wang, T.J.: Determining Optimal Cyclic Hoist Schedules in a Single Hoist Electroplating Line. IEE Transactions 26(2) (1994) 25–33

    Article  Google Scholar 

  17. McAloon, K., Tretkoff, C.: Optimization and Computational Logic. Wiley-Interscience (1996)

    Google Scholar 

  18. Phillips, L.W., Unger, P.S.: Mathematical Programming Solution of a Hoist Scheduling Problem. AIIE Transactions 8(2) (1976) 219–255

    Google Scholar 

  19. Rodošek, R., Wallace, M.G., Hajian, M.T.: A New Approach to Integrating Mixed Integer Programming with Constraint Logic Programming. Annals of Operational Research. Recent Advance in Combinatorial Optimization: Theory and Applications (to appear) http://www.icparc.ic.ac.uk/papers.html

  20. Smith, B.M., Brailsford, S.C., Hubbard, P.M., Williams, H.P.: The Progressive Party Problem: Integer Linear Programming and Constraint Programming Compared. Constraints 1(2) (1996) 119–138

    Article  MathSciNet  Google Scholar 

  21. Schimpf. J.: ECLiPSe Approach to Solver Integration and Cooperation. Proc. of the INFORMS CSTS Conf. Monterey (1998)

    Google Scholar 

  22. Sharpio, G.W., Nuttle, H.: Hoist Scheduling for a PBC Electroplating Facility. IIE Transactions 20(2) (1988) 157–167

    Article  Google Scholar 

  23. Dash Associates. XPRESS-MP Reference Manual. Dash Associates UK (1993)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Imperial College, IC-Parc, SW7-2AZ, London

    Robert Rodošek & Mark Wallace

Authors
  1. Robert Rodošek
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mark Wallace
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computing and Information Technology, Griffith University, Nathan, Queensland, 4111, Australia

    Michael Maher

  2. ILOG S.A., 9, rue de Verdun, BP 85, F-94253, Gentilly Cedex, France

    Jean-Francois Puget

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rodošek, R., Wallace, M. (1998). A Generic Model and Hybrid Algorithm for Hoist Scheduling Problems. In: Maher, M., Puget, JF. (eds) Principles and Practice of Constraint Programming — CP98. CP 1998. Lecture Notes in Computer Science, vol 1520. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49481-2_28

Download citation

  • DOI: https://doi.org/10.1007/3-540-49481-2_28

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65224-3

  • Online ISBN: 978-3-540-49481-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation