IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v56y2005i6d10.1057_palgrave.jors.2601859.html
   My bibliography  Save this article

Heuristical labour scheduling to optimize airport passenger flows

Author

Listed:
  • S Casado

    (Facultad C. Económicas y Empresariales, Pza. Infanta Elena, s/n.)

  • M Laguna

    (University of Colorado)

  • J Pacheco

    (Facultad C. Económicas y Empresariales, Pza. Infanta Elena, s/n.)

Abstract

We describe the development and implementation of a decision support system for the optimization of passenger flow by trading off service quality and labour costs at an airport. The system integrates a simulation module with an optimization module that requires that Dantzig's labour scheduling problem be solved in the order of thousands of times. We developed a customized scatter search to give the system the capability of finding high-quality solutions to the labour scheduling problems in short computational times. Our experiments verify that our scatter search implementation meets the needed requirements.

Suggested Citation

  • S Casado & M Laguna & J Pacheco, 2005. "Heuristical labour scheduling to optimize airport passenger flows," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(6), pages 649-658, June.
    • Handle: RePEc:pal:jorsoc:v:56:y:2005:i:6:d:10.1057_palgrave.jors.2601859
    DOI: 10.1057/palgrave.jors.2601859
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/palgrave.jors.2601859
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/palgrave.jors.2601859?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. Philip E. Taylor & Stephen J. Huxley, 1989. "A Break from Tradition for the San Francisco Police: Patrol Officer Scheduling Using an Optimization-Based Decision Support System," Interfaces, INFORMS, vol. 19(1), pages 4-24, February.
    2. Laguna, Manuel & Kelly, James P. & Gonzalez-Velarde, JoseLuis & Glover, Fred, 1995. "Tabu search for the multilevel generalized assignment problem," European Journal of Operational Research, Elsevier, vol. 82(1), pages 176-189, April.
    3. John J. Bartholdi, 1981. "A Guaranteed-Accuracy Round-off Algorithm for Cyclic Scheduling and Set Covering," Operations Research, INFORMS, vol. 29(3), pages 501-510, June.
    4. George B. Dantzig, 1954. "Letter to the Editor---A Comment on Edie's “Traffic Delays at Toll Booths”," Operations Research, INFORMS, vol. 2(3), pages 339-341, August.
    5. R Alvarez-Valdes & E Crespo & J M Tamarit, 1999. "Labour scheduling at an airport refuelling installation," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 50(3), pages 211-218, March.
    6. Manuel Laguna & Rafael Marti, 1999. "GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization," INFORMS Journal on Computing, INFORMS, vol. 11(1), pages 44-52, February.
    7. Bruce Andrews & Henry Parsons, 1993. "Establishing Telephone-Agent Staffing Levels through Economic Optimization," Interfaces, INFORMS, vol. 23(2), pages 14-20, April.
    8. Bruce H. Andrews & Henry L. Parsons, 1989. "L. L. Bean Chooses a Telephone Agent Scheduling System," Interfaces, INFORMS, vol. 19(6), pages 1-9, December.
    9. Turgut Aykin, 1996. "Optimal Shift Scheduling with Multiple Break Windows," Management Science, INFORMS, vol. 42(4), pages 591-602, April.
    10. Michael J. Brusco & Larry W. Jacobs & Robert J. Bongiorno & Duane V. Lyons & Baoxing Tang, 1995. "Improving Personnel Scheduling at Airline Stations," Operations Research, INFORMS, vol. 43(5), pages 741-751, October.
    11. Thomas J. Holloran & Judson E. Byrn, 1986. "United Airlines Station Manpower Planning System," Interfaces, INFORMS, vol. 16(1), pages 39-50, February.
    12. Phil Quinn & Bruce Andrews & Henry Parsons, 1991. "Allocating Telecommunications Resources at L. L. Bean, Inc," Interfaces, INFORMS, vol. 21(1), pages 75-91, February.
    13. Gary M. Thompson, 1995. "Improved Implicit Optimal Modeling of the Labor Shift Scheduling Problem," Management Science, INFORMS, vol. 41(4), pages 595-607, April.
    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. Najmaddin Akhundov & Nail Tahirov & Christoph H. Glock, 2022. "Optimal Scheduling of Waitstaff with Different Experience Levels at a Restaurant Chain," Interfaces, INFORMS, vol. 52(4), pages 324-343, July.
    2. Lin, Shih-Wei & Ying, Kuo-Ching, 2014. "Minimizing shifts for personnel task scheduling problems: A three-phase algorithm," European Journal of Operational Research, Elsevier, vol. 237(1), pages 323-334.
    3. Van den Bergh, Jorne & Beliën, Jeroen & De Bruecker, Philippe & Demeulemeester, Erik & De Boeck, Liesje, 2013. "Personnel scheduling: A literature review," European Journal of Operational Research, Elsevier, vol. 226(3), pages 367-385.
    4. M A Haughton, 2009. "An alternative tactic to deal with the contingency of driver absenteeism," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(9), pages 1207-1220, September.
    5. W L Ng & S C H Leung & J K P Lam & S W Pan, 2008. "Petrol delivery tanker assignment and routing: a case study in Hong Kong," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(9), pages 1191-1200, September.

    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. Easton, Fred F. & Mansour, Nashat, 1999. "A distributed genetic algorithm for deterministic and stochastic labor scheduling problems," European Journal of Operational Research, Elsevier, vol. 118(3), pages 505-523, November.
    2. Casado Yusta, S. & Pacheco Bonrostro, J., 2003. "Estudio comparativo de diferentes estrategias metaheurísticas para la resolución del labor scheduling problem./Analisys of different methauristas for solving labor scheduling," Estudios de Economia Aplicada, Estudios de Economia Aplicada, vol. 21, pages 537-554, December.
    3. Michael J. Brusco & Larry W. Jacobs, 1998. "Personnel Tour Scheduling When Starting-Time Restrictions Are Present," Management Science, INFORMS, vol. 44(4), pages 534-547, April.
    4. Noah Gans & Ger Koole & Avishai Mandelbaum, 2003. "Telephone Call Centers: Tutorial, Review, and Research Prospects," Manufacturing & Service Operations Management, INFORMS, vol. 5(2), pages 79-141, September.
    5. Linda V. Green & Peter J. Kolesar & João Soares, 2001. "Improving the Sipp Approach for Staffing Service Systems That Have Cyclic Demands," Operations Research, INFORMS, vol. 49(4), pages 549-564, August.
    6. Michael J. Brusco & Larry W. Jacobs, 2000. "Optimal Models for Meal-Break and Start-Time Flexibility in Continuous Tour Scheduling," Management Science, INFORMS, vol. 46(12), pages 1630-1641, December.
    7. Tolga Çezik & Oktay Günlük & Hanan Luss, 2001. "An integer programming model for the weekly tour scheduling problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 48(7), pages 607-624, October.
    8. Ernst, A. T. & Jiang, H. & Krishnamoorthy, M. & Sier, D., 2004. "Staff scheduling and rostering: A review of applications, methods and models," European Journal of Operational Research, Elsevier, vol. 153(1), pages 3-27, February.
    9. Anuj Mehrotra & Kenneth E. Murphy & Michael A. Trick, 2000. "Optimal shift scheduling: A branch‐and‐price approach," Naval Research Logistics (NRL), John Wiley & Sons, vol. 47(3), pages 185-200, April.
    10. Castillo, Ignacio & Joro, Tarja & Li, Yong Yue, 2009. "Workforce scheduling with multiple objectives," European Journal of Operational Research, Elsevier, vol. 196(1), pages 162-170, July.
    11. Giovanni Felici & Claudio Gentile, 2004. "A Polyhedral Approach for the Staff Rostering Problem," Management Science, INFORMS, vol. 50(3), pages 381-393, March.
    12. Brusco, Michael J. & Jacobs, Larry W., 1995. "Cost analysis of alternative formulations for personnel scheduling in continuously operating organizations," European Journal of Operational Research, Elsevier, vol. 86(2), pages 249-261, October.
    13. Defraeye, Mieke & Van Nieuwenhuyse, Inneke, 2016. "Staffing and scheduling under nonstationary demand for service: A literature review," Omega, Elsevier, vol. 58(C), pages 4-25.
    14. Sana Dahmen & Monia Rekik & François Soumis, 2018. "An implicit model for multi-activity shift scheduling problems," Journal of Scheduling, Springer, vol. 21(3), pages 285-304, June.
    15. Brusco, Michael J. & Jacobs, Larry W., 2001. "Starting-time decisions in labor tour scheduling: An experimental analysis and case study," European Journal of Operational Research, Elsevier, vol. 131(3), pages 459-475, June.
    16. Vijay Mehrotra & Thomas A. Grossman, 2009. "OR Process Skills Transform an Out-of-Control Call Center into a Strategic Asset," Interfaces, INFORMS, vol. 39(4), pages 346-352, August.
    17. Easton, F. F. & Rossin, D. F., 1997. "Overtime schedules for full-time service workers," Omega, Elsevier, vol. 25(3), pages 285-299, June.
    18. Arpan Rijal & Marco Bijvank & Asvin Goel & René de Koster, 2021. "Workforce Scheduling with Order-Picking Assignments in Distribution Facilities," Transportation Science, INFORMS, vol. 55(3), pages 725-746, May.
    19. Melanie Erhard, 2021. "Flexible staffing of physicians with column generation," Flexible Services and Manufacturing Journal, Springer, vol. 33(1), pages 212-252, March.
    20. Aykin, Turgut, 2000. "A comparative evaluation of modeling approaches to the labor shift scheduling problem," European Journal of Operational Research, Elsevier, vol. 125(2), pages 381-397, September.

    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:pal:jorsoc:v:56:y:2005:i:6:d:10.1057_palgrave.jors.2601859. 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.palgrave-journals.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.