Skip to main content
SpringerLink
Log in

An Integrated Method for Planning and Scheduling to Minimize Tardiness

  • Published:
Constraints Aims and scope Submit manuscript

Abstract

We combine mixed integer linear programming (MILP) and constraint programming (CP) to minimize tardiness in planning and scheduling. Tasks are allocated to facilities using MILP and scheduled using CP, and the two are linked via logic-based Benders decomposition. We consider two objectives: minimizing the number of late tasks, and minimizing total tardiness. Our main theoretical contribution is a relaxation of the cumulative scheduling subproblem, which is critical to performance. We obtain substantial computational speedups relative to the state of the art in both MILP and CP. We also obtain much better solutions for problems that cannot be solved to optimality.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Benders, J. F. (1962). Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik, 4, 238–252.

    Article  MATH  MathSciNet  Google Scholar 

  2. Cambazard, H., Hladik, P.-E., Déplanche, A.-M., Jussien, N., & Trinquet, Y. (2004). Decomposition and learning for a hard real time task allocation problem. In M. Wallace (Ed.), Principles and practice of constraint programming (CP2004), Volume 3258 of Lecture Notes in Computer Science (pp. 153–167). Berlin Heidelberg New York: Springer.

    Google Scholar 

  3. Chu, Y., & Xia, Q. (2004). Generating benders cuts for a class of integer programming problems. In J. C. Régin & M. Rueher (Eds.), Integration of AI and OR techniques in constraint programming for combinatorial optimization problems (CPAIOR 2004), volume 3011 of Lecture Notes in Computer Science (pp. 127–141). Berlin Heidelberg New York: Springer.

    Google Scholar 

  4. Corréa, A. I., Langevin, A., & Rousseau, L. M. (2004). Dispatching and conflict-free routing of automated guided vehicles: A hybrid approach combining constraint programming and mixed integer programming. In J. C. Régin & M. Rueher (Eds.), Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2004), volume 3011 of Lecture Notes in Computer Science (pp. 370–378). Berlin Heidelberg New York: Springer.

    Google Scholar 

  5. Eremin, A., & Wallace, M. (2001). Hybrid Benders decomposition algorithm in constraint logic programming. In T. Walsh (Ed.), Principles and practice of constraint programming (CP2001), volume 2239 of Lecture Notes in Computer Science (pp. 1–15). Berlin Heidelberg New York: Springer.

    Google Scholar 

  6. Geoffrion, A. M. (1972) Generalized benders decomposition. Journal of Optimization Theory and Applications, 10, 237–260.

    Article  MATH  MathSciNet  Google Scholar 

  7. Harjunkoski, I., & Grossmann, I. E. (2001). A decomposition approach for the scheduling of a steel plant production. Computers and Chemical Engineering, 25, 1647–1660.

    Article  Google Scholar 

  8. Hooker, J. N. (2000). Logic-based methods for optimization: combining optimization and Constraint Satisfaction. New York: Wiley.

    Google Scholar 

  9. Hooker, J. N. (2004). A hybrid method for planning and scheduling. In M. Wallace (Ed.), Principles and practice of constraint programming (CP2004), volume 3258 of Lecture Notes in Computer Science (pp. 305–316). Berlin Heidelberg New York: Springer.

    Google Scholar 

  10. Hooker, J. N. (2005). A hybrid method for planning and scheduling. Constraints, 10, 385–401.

    Article  MathSciNet  Google Scholar 

  11. Hooker, J. N. (2005). Planning and scheduling to minimize tardiness. In Principles and practice of constraint programming (CP2005), Lecture Notes in Computer Science. Berlin Heidelberg New York: Springer.

    Google Scholar 

  12. Hooker, J. N., & Ottosson, G. (2003). Logic-based Benders decomposition. Mathematical Programming, 96, 33–60.

    MathSciNet  Google Scholar 

  13. Hooker, J. N., & Yan, H. (1995). Logic circuit verification by benders decomposition. In V. Saraswat & P. Van Hentenryck (Eds.), Principles and practice of constraint programming: The Newport Papers (pp. 267–288). Cambridge, Massachusetts: MIT.

    Google Scholar 

  14. Hooker, J. N., & Yan, H. (2002). A relaxation for the cumulative constraint. In P. Van Hentenryck (Ed.), Principles and practice of constraint programming, volume 2470 of Lecture Notes in Computer Science (pp. 686–690). Berlin Heidelberg New York: Springer.

    Google Scholar 

  15. Jain, V., & Grossmann, I. E. (2001). Algorithms for hybrid MILP/CP models for a class of optimization problems. INFORMS Journal on Computing, 13, 258–276.

    Article  MathSciNet  Google Scholar 

  16. Maravelias, C. T., & Grossmann, I. E. (2004). Using MILP and CP for the scheduling of batch chemical processes. In J. C. Régin & M. Rueher (Eds.), Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization problems (CPAIOR 2004), volume 3011 of Lecture Notes in Computer Science (pp. 1–20). Berlin Heidelberg New York: Springer.

    Google Scholar 

  17. Thorsteinsson, E. (2001). Branch and check: A hybrid framework integrating mixed integer programming and constraint logic programming. In T. Walsh (Ed.), Principles and practice of constraint programming (CP2001), volume 2239 of Lecture Notes in Computer Science (pp. 16–30). Berlin Heidelberg New York: Springer.

    Google Scholar 

  18. Timpe, C. (2002). Solving planning and scheduling problems with combined integer and constraint programming. OR Spectrum, 24, 431–448.

    Article  MATH  Google Scholar 

  19. Türkay, M., & Grossmann, I. E.(1996). Logic-based MINLP algorithms for the optimal synthesis of process networks. Computers and Chemical Engineering, 20, 959–978.

    Article  Google Scholar 

  20. Xia, Q., Eremin, A., & Wallace, M. (2004). Problem decomposition for traffic diversions. In J. C. Régin & M. Rueher (Eds.), Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2004), volume 3011 of Lecture Notes in Computer Science (pp. 348–363). Berlin Heidelberg New York: Springer.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Carnegie Mellon University, Pittsburgh, PA, USA

    J. N. Hooker

Authors
  1. J. N. Hooker
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to J. N. Hooker.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hooker, J.N. An Integrated Method for Planning and Scheduling to Minimize Tardiness. Constraints 11, 139–157 (2006). https://doi.org/10.1007/s10601-006-8060-2

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10601-006-8060-2

Keywords

Search

Navigation