IDEAS home Printed from https://ideas.repec.org/a/eee/jaitra/v12y2006i2p76-81.html
   My bibliography  Save this article

Scheduling baggage-handling facilities in congested airports

Author

Listed:
  • Abdelghany, Ahmed
  • Abdelghany, Khaled
  • Narasimhan, Ram

Abstract

A model for scheduling baggage-handling facilities in congested airports is presented. The model assigns the baggage of departing flights to available piers in the baggage-handling facility. It adopts an activity selection algorithm that is generally used to assign limited infrastructure resources to a number of prescheduled competing activities. The model considers various operational requirements associated with the baggage-handling process. The model is applied to a daily schedule of a major US air-carrier at one of its major hubs. The results illustrate the need to consider trade-offs between satisfying the different operation requirements and achieving a near-optimal solution to the problem.

Suggested Citation

  • Abdelghany, Ahmed & Abdelghany, Khaled & Narasimhan, Ram, 2006. "Scheduling baggage-handling facilities in congested airports," Journal of Air Transport Management, Elsevier, vol. 12(2), pages 76-81.
    • Handle: RePEc:eee:jaitra:v:12:y:2006:i:2:p:76-81
    DOI: 10.1016/j.jairtraman.2005.10.001
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0969699705000979
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.jairtraman.2005.10.001?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. A Bolat, 1999. "Assigning arriving flights at an airport to the available gates," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 50(1), pages 23-34, January.
    2. Carlier, Jacques, 1982. "The one-machine sequencing problem," European Journal of Operational Research, Elsevier, vol. 11(1), pages 42-47, September.
    3. Grabowski, J. & Nowicki, E. & Zdrzalka, S., 1986. "A block approach for single-machine scheduling with release dates and due dates," European Journal of Operational Research, Elsevier, vol. 26(2), pages 278-285, August.
    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. Martina Zámková & Luboš Střelec & Martin Prokop & Radek Stolín, 2021. "Flight Delay Causes at Selected Visegrad Group International Airports," European Journal of Business Science and Technology, Mendel University in Brno, Faculty of Business and Economics, vol. 7(1), pages 91-108.
    2. Martina Zámková & Stanislav Rojík & Martin Prokop & Radek Stolín, 2022. "Factors Affecting the International Flight Delays and Their Impact on Airline Operation and Management and Passenger Compensations Fees in Air Transport Industry: Case Study of a Selected Airlines in ," Sustainability, MDPI, vol. 14(22), pages 1-16, November.
    3. Amadeo Ascó, 2016. "An Analysis of Robustness Approaches for the Airport Baggage Sorting Station Assignment Problem," Journal of Optimization, Hindawi, vol. 2016, pages 1-19, September.
    4. Torben C. Barth & David Pisinger, 2021. "Baggage Carousel Assignment at Airports: Model and Case Study," SN Operations Research Forum, Springer, vol. 2(1), pages 1-27, March.
    5. Markus Frey & Rainer Kolisch & Christian Artigues, 2017. "Column Generation for Outbound Baggage Handling at Airports," Transportation Science, INFORMS, vol. 51(4), pages 1226-1241, November.
    6. Dirk Briskorn & Simon Emde & Nils Boysen, 2017. "Scheduling shipments in closed-loop sortation conveyors," Journal of Scheduling, Springer, vol. 20(1), pages 25-42, February.
    7. Huang, Edward & Liu, Irene & Lin, James T., 2018. "Robust model for the assignment of outgoing flights on airport baggage unloading areas," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 115(C), pages 110-125.
    8. Huang, Edward & Mital, Pratik & Goetschalckx, Marc & Wu, Kan, 2016. "Optimal assignment of airport baggage unloading zones to outgoing flights," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 94(C), pages 110-122.
    9. Boysen, Nils & Briskorn, Dirk & Fedtke, Stefan & Schmickerath, Marcel, 2019. "Automated sortation conveyors: A survey from an operational research perspective," European Journal of Operational Research, Elsevier, vol. 276(3), pages 796-815.

    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. Pan, Yunpeng & Shi, Leyuan, 2006. "Branch-and-bound algorithms for solving hard instances of the one-machine sequencing problem," European Journal of Operational Research, Elsevier, vol. 168(3), pages 1030-1039, February.
    2. Federico Alonso-Pecina & José Alberto Hernández & José Maria Sigarreta & Nodari Vakhania, 2020. "Fast Approximation for Scheduling One Machine," Mathematics, MDPI, vol. 8(9), pages 1-18, September.
    3. Jain, A. S. & Meeran, S., 1999. "Deterministic job-shop scheduling: Past, present and future," European Journal of Operational Research, Elsevier, vol. 113(2), pages 390-434, March.
    4. Pezzella, Ferdinando & Merelli, Emanuela, 2000. "A tabu search method guided by shifting bottleneck for the job shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 120(2), pages 297-310, January.
    5. Egon Balas & Alkis Vazacopoulos, 1998. "Guided Local Search with Shifting Bottleneck for Job Shop Scheduling," Management Science, INFORMS, vol. 44(2), pages 262-275, February.
    6. Joao António Noivo & Helena Ramalhinho-Lourenço, 1998. "Solving two production scheduling problems with sequence-dependent set-up times," Economics Working Papers 338, Department of Economics and Business, Universitat Pompeu Fabra.
    7. Ivens, Philip & Lambrecht, Marc, 1996. "Extending the shifting bottleneck procedure to real-life applications," European Journal of Operational Research, Elsevier, vol. 90(2), pages 252-268, April.
    8. M. Urgo & J. Váncza, 2019. "A branch-and-bound approach for the single machine maximum lateness stochastic scheduling problem to minimize the value-at-risk," Flexible Services and Manufacturing Journal, Springer, vol. 31(2), pages 472-496, June.
    9. Blazewicz, Jacek & Domschke, Wolfgang & Pesch, Erwin, 1996. "The job shop scheduling problem: Conventional and new solution techniques," European Journal of Operational Research, Elsevier, vol. 93(1), pages 1-33, August.
    10. Helena Ramalhinho-Lourenço & Olivier C. Martin & Thomas Stützle, 2000. "Iterated local search," Economics Working Papers 513, Department of Economics and Business, Universitat Pompeu Fabra.
    11. Wenda Zhang & Jason J. Sauppe & Sheldon H. Jacobson, 2021. "An Improved Branch-and-Bound Algorithm for the One-Machine Scheduling Problem with Delayed Precedence Constraints," INFORMS Journal on Computing, INFORMS, vol. 33(3), pages 1091-1102, July.
    12. Gueret, Christelle & Jussien, Narendra & Prins, Christian, 2000. "Using intelligent backtracking to improve branch-and-bound methods: An application to Open-Shop problems," European Journal of Operational Research, Elsevier, vol. 127(2), pages 344-354, December.
    13. Riezebos, J. & Gaalman, G. J. C., 1998. "Time lag size in multiple operations flow shop scheduling heuristics," European Journal of Operational Research, Elsevier, vol. 105(1), pages 72-90, February.
    14. Walter, Rico & Schulze, Philipp & Scholl, Armin, 2021. "SALSA: Combining branch-and-bound with dynamic programming to smoothen workloads in simple assembly line balancing," European Journal of Operational Research, Elsevier, vol. 295(3), pages 857-873.
    15. Carlier, J. & Pinson, E. & Sahli, A. & Jouglet, A., 2020. "An O(n2) algorithm for time-bound adjustments for the cumulative scheduling problem," European Journal of Operational Research, Elsevier, vol. 286(2), pages 468-476.
    16. C N Potts & V A Strusevich, 2009. "Fifty years of scheduling: a survey of milestones," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 41-68, May.
    17. Dorndorf, Ulrich & Drexl, Andreas & Nikulin, Yury & Pesch, Erwin, 2005. "Flight gate scheduling: State-of-the-art and recent developments," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 584, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    18. Ansis Ozolins, 2020. "Bounded dynamic programming algorithm for the job shop problem with sequence dependent setup times," Operational Research, Springer, vol. 20(3), pages 1701-1728, September.
    19. Sciau, Jean-Baptiste & Goyon, Agathe & Sarazin, Alexandre & Bascans, Jérémy & Prud’homme, Charles & Lorca, Xavier, 2024. "Using constraint programming to address the operational aircraft line maintenance scheduling problem," Journal of Air Transport Management, Elsevier, vol. 115(C).
    20. Hu, Rong & Wang, Deyun & Feng, Huilin & Zhang, Junfeng & Pan, Xiaoran & Deng, Songwu, 2024. "Joint gate-runway scheduling considering carbon emissions, airport noise and ground-air coordination," Journal of Air Transport Management, Elsevier, vol. 116(C).

    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:jaitra:v:12:y:2006:i:2:p:76-81. 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.journals.elsevier.com/journal-of-air-transport-management/ .

    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.