IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v210y2013i1p245-27210.1007-s10479-011-1031-z.html
   My bibliography  Save this article

Single-facility scheduling by logic-based Benders decomposition

Author

Listed:
  • Elvin Coban
  • J. Hooker

Abstract

Logic-based Benders decomposition can combine mixed integer programming and constraint programming to solve planning and scheduling problems much faster than either method alone. We find that a similar technique can be beneficial for solving pure scheduling problems as the problem size scales up. We solve single-facility non-preemptive scheduling problems with time windows and long time horizons. The Benders master problem assigns jobs to predefined segments of the time horizon, where the subproblem schedules them. In one version of the problem, jobs may not overlap the segment boundaries (which represent shutdown times, such as weekends), and in another version, there is no such restriction. The objective is to find feasible solutions, minimize makespan, or minimize total tardiness. Copyright Springer Science+Business Media, LLC 2013

Suggested Citation

  • Elvin Coban & J. Hooker, 2013. "Single-facility scheduling by logic-based Benders decomposition," Annals of Operations Research, Springer, vol. 210(1), pages 245-272, November.
    • Handle: RePEc:spr:annopr:v:210:y:2013:i:1:p:245-272:10.1007/s10479-011-1031-z
    DOI: 10.1007/s10479-011-1031-z
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-011-1031-z
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10479-011-1031-z?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Vipul Jain & Ignacio E. Grossmann, 2001. "Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems," INFORMS Journal on Computing, INFORMS, vol. 13(4), pages 258-276, November.
    2. SADYKOV, Ruslan & WOLSEY, Laurence A., 2006. "Integer programming and constraint programming in solving a multimachine assignment scheduling problem with deadlines and release dates," LIDAM Reprints CORE 1854, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    3. Ruslan Sadykov & Laurence A. Wolsey, 2006. "Integer Programming and Constraint Programming in Solving a Multimachine Assignment Scheduling Problem with Deadlines and Release Dates," INFORMS Journal on Computing, INFORMS, vol. 18(2), pages 209-217, May.
    4. Koulamas, Christos, 2010. "The single-machine total tardiness scheduling problem: Review and extensions," European Journal of Operational Research, Elsevier, vol. 202(1), pages 1-7, April.
    5. Gianni Codato & Matteo Fischetti, 2006. "Combinatorial Benders' Cuts for Mixed-Integer Linear Programming," Operations Research, INFORMS, vol. 54(4), pages 756-766, August.
    6. J. N. Hooker, 2007. "Planning and Scheduling by Logic-Based Benders Decomposition," Operations Research, INFORMS, vol. 55(3), pages 588-602, June.
    7. John N. Hooker, 2007. "Integrated Methods for Optimization," International Series in Operations Research and Management Science, Springer, number 978-0-387-38274-6, March.
    8. Rasmussen, Rasmus V. & Trick, Michael A., 2007. "A Benders approach for the constrained minimum break problem," European Journal of Operational Research, Elsevier, vol. 177(1), pages 198-213, February.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Aigerim Saken & Emil Karlsson & Stephen J. Maher & Elina Rönnberg, 2023. "Computational Evaluation of Cut-Strengthening Techniques in Logic-Based Benders’ Decomposition," SN Operations Research Forum, Springer, vol. 4(3), pages 1-53, September.
    2. Velez, Sara & Dong, Yachao & Maravelias, Christos T., 2017. "Changeover formulations for discrete-time mixed-integer programming scheduling models," European Journal of Operational Research, Elsevier, vol. 260(3), pages 949-963.
    3. Jenny Nossack & Dirk Briskorn & Erwin Pesch, 2018. "Container Dispatching and Conflict-Free Yard Crane Routing in an Automated Container Terminal," Transportation Science, INFORMS, vol. 52(5), pages 1059-1076, October.
    4. Karim Pérez Martínez & Yossiri Adulyasak & Raf Jans, 2022. "Logic-Based Benders Decomposition for Integrated Process Configuration and Production Planning Problems," INFORMS Journal on Computing, INFORMS, vol. 34(4), pages 2177-2191, July.
    5. Unsal, Ozgur & Oguz, Ceyda, 2019. "An exact algorithm for integrated planning of operations in dry bulk terminals," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 126(C), pages 103-121.
    6. Aliza Heching & J. N. Hooker & Ryo Kimura, 2019. "A Logic-Based Benders Approach to Home Healthcare Delivery," Transportation Science, INFORMS, vol. 53(2), pages 510-522, March.
    7. Yanina Fumero & Gabriela Corsano & Jorge M. Montagna, 2017. "An MILP model for planning of batch plants operating in a campaign-mode," Annals of Operations Research, Springer, vol. 258(2), pages 415-435, November.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Velez, Sara & Dong, Yachao & Maravelias, Christos T., 2017. "Changeover formulations for discrete-time mixed-integer programming scheduling models," European Journal of Operational Research, Elsevier, vol. 260(3), pages 949-963.
    2. Gedik, Ridvan & Rainwater, Chase & Nachtmann, Heather & Pohl, Ed A., 2016. "Analysis of a parallel machine scheduling problem with sequence dependent setup times and job availability intervals," European Journal of Operational Research, Elsevier, vol. 251(2), pages 640-650.
    3. Riise, Atle & Mannino, Carlo & Lamorgese, Leonardo, 2016. "Recursive logic-based Benders’ decomposition for multi-mode outpatient scheduling," European Journal of Operational Research, Elsevier, vol. 255(3), pages 719-728.
    4. Rahmaniani, Ragheb & Crainic, Teodor Gabriel & Gendreau, Michel & Rei, Walter, 2017. "The Benders decomposition algorithm: A literature review," European Journal of Operational Research, Elsevier, vol. 259(3), pages 801-817.
    5. Giorgi Tadumadze & Simon Emde & Heiko Diefenbach, 2020. "Exact and heuristic algorithms for scheduling jobs with time windows on unrelated parallel machines," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 42(2), pages 461-497, June.
    6. Yantong Li & Jean-François Côté & Leandro Callegari-Coelho & Peng Wu, 2022. "Novel Formulations and Logic-Based Benders Decomposition for the Integrated Parallel Machine Scheduling and Location Problem," INFORMS Journal on Computing, INFORMS, vol. 34(2), pages 1048-1069, March.
    7. Luca Benini & Michele Lombardi & Michela Milano & Martino Ruggiero, 2011. "Optimal resource allocation and scheduling for the CELL BE platform," Annals of Operations Research, Springer, vol. 184(1), pages 51-77, April.
    8. Roshanaei, Vahid & Luong, Curtiss & Aleman, Dionne M. & Urbach, David, 2017. "Propagating logic-based Benders’ decomposition approaches for distributed operating room scheduling," European Journal of Operational Research, Elsevier, vol. 257(2), pages 439-455.
    9. Lotte Berghman & Roel Leus & Frits Spieksma, 2014. "Optimal solutions for a dock assignment problem with trailer transportation," Annals of Operations Research, Springer, vol. 213(1), pages 3-25, February.
    10. Jean-François Côté & Mauro Dell'Amico & Manuel Iori, 2014. "Combinatorial Benders' Cuts for the Strip Packing Problem," Operations Research, INFORMS, vol. 62(3), pages 643-661, June.
    11. Raf Jans, 2009. "Solving Lot-Sizing Problems on Parallel Identical Machines Using Symmetry-Breaking Constraints," INFORMS Journal on Computing, INFORMS, vol. 21(1), pages 123-136, February.
    12. Senay Solak & Christina Scherrer & Ahmed Ghoniem, 2014. "The stop-and-drop problem in nonprofit food distribution networks," Annals of Operations Research, Springer, vol. 221(1), pages 407-426, October.
    13. Qin, Tianbao & Du, Yuquan & Sha, Mei, 2016. "Evaluating the solution performance of IP and CP for berth allocation with time-varying water depth," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 87(C), pages 167-185.
    14. Nascimento, Paulo Jorge & Silva, Cristóvão & Antunes, Carlos Henggeler & Moniz, Samuel, 2024. "Optimal decomposition approach for solving large nesting and scheduling problems of additive manufacturing systems," European Journal of Operational Research, Elsevier, vol. 317(1), pages 92-110.
    15. Berghman, Lotte & Leus, Roel, 2015. "Practical solutions for a dock assignment problem with trailer transportation," European Journal of Operational Research, Elsevier, vol. 246(3), pages 787-799.
    16. Guo, Penghui & Zhu, Jianjun, 2023. "Capacity reservation for humanitarian relief: A logic-based Benders decomposition method with subgradient cut," European Journal of Operational Research, Elsevier, vol. 311(3), pages 942-970.
    17. Stefano Gualandi & Federico Malucelli, 2012. "Exact Solution of Graph Coloring Problems via Constraint Programming and Column Generation," INFORMS Journal on Computing, INFORMS, vol. 24(1), pages 81-100, February.
    18. Fang, Kan & Wang, Shijin & Pinedo, Michael L. & Chen, Lin & Chu, Feng, 2021. "A combinatorial Benders decomposition algorithm for parallel machine scheduling with working-time restrictions," European Journal of Operational Research, Elsevier, vol. 291(1), pages 128-146.
    19. Kiho Seo & Seulgi Joung & Chungmok Lee & Sungsoo Park, 2022. "A Closest Benders Cut Selection Scheme for Accelerating the Benders Decomposition Algorithm," INFORMS Journal on Computing, INFORMS, vol. 34(5), pages 2804-2827, September.
    20. Siqian Shen & J. Smith, 2013. "A decomposition approach for solving a broadcast domination network design problem," Annals of Operations Research, Springer, vol. 210(1), pages 333-360, November.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:210:y:2013:i:1:p:245-272:10.1007/s10479-011-1031-z. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.