IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v263y2017i3p805-814.html
   My bibliography  Save this article

A branch-and-price algorithm for the Aperiodic Multi-Period Service Scheduling Problem

Author

Listed:
  • Fernández, Elena
  • Kalcsics, Jörg
  • Núñez-del-Toro, Cristina

Abstract

This paper considers the multi-period service scheduling problem with an aperiodic service policy. In this problem, a set of customers who periodically require service over a finite time horizon is given. To satisfy the service demands, a set of operators is given, each with a fixed capacity in terms of the number of customers that can be served per period. With an aperiodic policy, customers may be served before the period were the service would be due. Two criteria are jointly considered in this problem: the total number of operators, and the total number of ahead-of-time periods. The task is to determine the service periods for each customer in such a way that the service requests of the customers are fulfilled and both criteria are minimized. A new integer programming formulation is proposed, which outperforms an existing formulation. Since the computational effort required to obtain solutions considerably increases with the size of the instances, we also present a reformulation suitable for column generation, which is then integrated within a branch-and-price algorithm. Computational experiments highlight the efficiency of this algorithm for the larger instances.

Suggested Citation

  • Fernández, Elena & Kalcsics, Jörg & Núñez-del-Toro, Cristina, 2017. "A branch-and-price algorithm for the Aperiodic Multi-Period Service Scheduling Problem," European Journal of Operational Research, Elsevier, vol. 263(3), pages 805-814.
    • Handle: RePEc:eee:ejores:v:263:y:2017:i:3:p:805-814
    DOI: 10.1016/j.ejor.2017.06.008
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S037722171730526X
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2017.06.008?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. Núñez-del-Toro, Cristina & Fernández, Elena & Kalcsics, Jörg & Nickel, Stefan, 2016. "Scheduling policies for multi-period services," European Journal of Operational Research, Elsevier, vol. 251(3), pages 751-770.
    2. Pamela H. Vance & Cynthia Barnhart & Ellis L. Johnson & George L. Nemhauser, 1997. "Airline Crew Scheduling: A New Formulation and Decomposition Algorithm," Operations Research, INFORMS, vol. 45(2), pages 188-200, April.
    3. Cynthia Barnhart & Ellis L. Johnson & George L. Nemhauser & Martin W. P. Savelsbergh & Pamela H. Vance, 1998. "Branch-and-Price: Column Generation for Solving Huge Integer Programs," Operations Research, INFORMS, vol. 46(3), pages 316-329, June.
    4. Amotz Bar-Noy & Randeep Bhatia & Joseph (Seffi) Naor & Baruch Schieber, 2002. "Minimizing Service and Operation Costs of Periodic Scheduling," Mathematics of Operations Research, INFORMS, vol. 27(3), pages 518-544, August.
    5. Grigoriev, Alexander & van de Klundert, Joris & Spieksma, Frits C.R., 2006. "Modeling and solving the periodic maintenance problem," European Journal of Operational Research, Elsevier, vol. 172(3), pages 783-797, August.
    6. Pereira Lopes, Manuel J. & de Carvalho, J.M. Valerio, 2007. "A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times," European Journal of Operational Research, Elsevier, vol. 176(3), pages 1508-1527, February.
    7. Campbell, Ann Melissa & Hardin, Jill R., 2005. "Vehicle minimization for periodic deliveries," European Journal of Operational Research, Elsevier, vol. 165(3), pages 668-684, September.
    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. Setareh Boshrouei Shargh & Mostafa Zandieh & Ashkan Ayough & Farbod Farhadi, 2024. "Scheduling in services: a review and bibliometric analysis," Operations Management Research, Springer, vol. 17(2), pages 754-783, June.
    2. Pawnrat Thumrongvut & Kanchana Sethanan & Thitipong Jamrus & Chuleeporn Wongloucha & Rapeepan Pitakaso & Paulina Golinska-Dawson, 2022. "Metaheuristics in Business Model Development for Local Tourism Sustainability Enhancement," Mathematics, MDPI, vol. 10(24), pages 1-21, December.

    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. Núñez-del-Toro, Cristina & Fernández, Elena & Kalcsics, Jörg & Nickel, Stefan, 2016. "Scheduling policies for multi-period services," European Journal of Operational Research, Elsevier, vol. 251(3), pages 751-770.
    2. Maenhout, Broos & Vanhoucke, Mario, 2010. "A hybrid scatter search heuristic for personalized crew rostering in the airline industry," European Journal of Operational Research, Elsevier, vol. 206(1), pages 155-167, October.
    3. Maquirriain, Javier & García-Villoria, Alberto & Pastor, Rafael, 2024. "Matheuristics for scheduling of maintenance service with linear operation cost and step function maintenance cost," European Journal of Operational Research, Elsevier, vol. 315(1), pages 73-87.
    4. Marc Peeters & Zeger Degraeve, 2004. "The Co-Printing Problem: A Packing Problem with a Color Constraint," Operations Research, INFORMS, vol. 52(4), pages 623-638, August.
    5. Rauchecker, Gerhard & Schryen, Guido, 2019. "An exact branch-and-price algorithm for scheduling rescue units during disaster response," European Journal of Operational Research, Elsevier, vol. 272(1), pages 352-363.
    6. Grigoriev, Alexander & van de Klundert, Joris & Spieksma, Frits C.R., 2006. "Modeling and solving the periodic maintenance problem," European Journal of Operational Research, Elsevier, vol. 172(3), pages 783-797, August.
    7. Beraudy, Sébastien & Absi, Nabil & Dauzère-Pérès, Stéphane, 2022. "Timed route approaches for large multi-product multi-step capacitated production planning problems," European Journal of Operational Research, Elsevier, vol. 300(2), pages 602-614.
    8. Cynthia Barnhart & Peter Belobaba & Amedeo R. Odoni, 2003. "Applications of Operations Research in the Air Transport Industry," Transportation Science, INFORMS, vol. 37(4), pages 368-391, November.
    9. Mohamed Haouari & Farah Zeghal Mansour & Hanif D. Sherali, 2019. "A New Compact Formulation for the Daily Crew Pairing Problem," Transportation Science, INFORMS, vol. 53(3), pages 811-828, May.
    10. Cynthia Barnhart & Christopher A. Hane & Pamela H. Vance, 2000. "Using Branch-and-Price-and-Cut to Solve Origin-Destination Integer Multicommodity Flow Problems," Operations Research, INFORMS, vol. 48(2), pages 318-326, April.
    11. Guglielmo Lulli & Suvrajeet Sen, 2004. "A Branch-and-Price Algorithm for Multistage Stochastic Integer Programming with Application to Stochastic Batch-Sizing Problems," Management Science, INFORMS, vol. 50(6), pages 786-796, June.
    12. Degraeve, Z. & Jans, R.F., 2003. "A New Dantzig-Wolfe Reformulation And Branch-And-Price Algorithm For The Capacitated Lot Sizing Problem With Set Up Times," ERIM Report Series Research in Management ERS-2003-010-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    13. Frédéric Quesnel & Guy Desaulniers & Frédéric Quesnel, 2020. "Improving Air Crew Rostering by Considering Crew Preferences in the Crew Pairing Problem," Transportation Science, INFORMS, vol. 54(1), pages 97-114, January.
    14. Ellis L. Johnson & George L. Nemhauser & Martin W.P. Savelsbergh, 2000. "Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition," INFORMS Journal on Computing, INFORMS, vol. 12(1), pages 2-23, February.
    15. Amy Mainville Cohn & Cynthia Barnhart, 2003. "Improving Crew Scheduling by Incorporating Key Maintenance Routing Decisions," Operations Research, INFORMS, vol. 51(3), pages 387-396, June.
    16. Gamvros, Ioannis & Raghavan, S., 2012. "Multi-period traffic routing in satellite networks," European Journal of Operational Research, Elsevier, vol. 219(3), pages 738-750.
    17. Mohammed Saddoune & Guy Desaulniers & Issmail Elhallaoui & François Soumis, 2012. "Integrated Airline Crew Pairing and Crew Assignment by Dynamic Constraint Aggregation," Transportation Science, INFORMS, vol. 46(1), pages 39-55, February.
    18. Syam Menon & Linus Schrage, 2002. "Order Allocation for Stock Cutting in the Paper Industry," Operations Research, INFORMS, vol. 50(2), pages 324-332, April.
    19. Okan Örsan Özener & Melda Örmeci Matoğlu & Güneş Erdoğan & Mohamed Haouari & Hasan Sözer, 2017. "Solving a large-scale integrated fleet assignment and crew pairing problem," Annals of Operations Research, Springer, vol. 253(1), pages 477-500, June.
    20. Gizem Keysan & George L. Nemhauser & Martin W. P. Savelsbergh, 2010. "Tactical and Operational Planning of Scheduled Maintenance for Per-Seat, On-Demand Air Transportation," Transportation Science, INFORMS, vol. 44(3), pages 291-306, August.

    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:eee:ejores:v:263:y:2017:i:3:p:805-814. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.