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

Airline crew scheduling using Potts mean field techniques

Author

Listed:
  • Lagerholm, Martin
  • Peterson, Carsten
  • Soderberg, Bo

Abstract

No abstract is available for this item.

Suggested Citation

  • Lagerholm, Martin & Peterson, Carsten & Soderberg, Bo, 2000. "Airline crew scheduling using Potts mean field techniques," European Journal of Operational Research, Elsevier, vol. 120(1), pages 81-96, January.
    • Handle: RePEc:eee:ejores:v:120:y:2000:i:1:p:81-96
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(98)00387-7
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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. Karla L. Hoffman & Manfred Padberg, 1993. "Solving Airline Crew Scheduling Problems by Branch-and-Cut," Management Science, INFORMS, vol. 39(6), pages 657-682, June.
    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. Ohlsson, Mattias & Peterson, Carsten & Soderberg, Bo, 2001. "An efficient mean field approach to the set covering problem," European Journal of Operational Research, Elsevier, vol. 133(3), pages 583-595, 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. 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.
    2. Sriram, Chellappan & Haghani, Ali, 2003. "An optimization model for aircraft maintenance scheduling and re-assignment," Transportation Research Part A: Policy and Practice, Elsevier, vol. 37(1), pages 29-48, January.
    3. Rossi, Fabrizio & Smriglio, Stefano, 2001. "A set packing model for the ground holding problem in congested networks," European Journal of Operational Research, Elsevier, vol. 131(2), pages 400-416, June.
    4. Erwin Abbink & Matteo Fischetti & Leo Kroon & Gerrit Timmer & Michiel Vromans, 2005. "Reinventing Crew Scheduling at Netherlands Railways," Interfaces, INFORMS, vol. 35(5), pages 393-401, October.
    5. Drexl, Andreas & Nissen, Rudiger & Patterson, James H. & Salewski, Frank, 2000. "ProGen/[pi]x - An instance generator for resource-constrained project scheduling problems with partially renewable resources and further extensions," European Journal of Operational Research, Elsevier, vol. 125(1), pages 59-72, August.
    6. 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).
    7. Masoud Yaghini & Mohammad Karimi & Mohadeseh Rahbar, 2015. "A set covering approach for multi-depot train driver scheduling," Journal of Combinatorial Optimization, Springer, vol. 29(3), pages 636-654, April.
    8. Martin Durbin & Karla Hoffman, 2008. "OR PRACTICE---The Dance of the Thirty-Ton Trucks: Dispatching and Scheduling in a Dynamic Environment," Operations Research, INFORMS, vol. 56(1), pages 3-19, February.
    9. 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.
    10. Zwaneveld, Peter J. & Kroon, Leo G. & van Hoesel, Stan P. M., 2001. "Routing trains through a railway station based on a node packing model," European Journal of Operational Research, Elsevier, vol. 128(1), pages 14-33, January.
    11. Zeren, Bahadır & Özcan, Ender & Deveci, Muhammet, 2024. "An adaptive greedy heuristic for large scale airline crew pairing problems," Journal of Air Transport Management, Elsevier, vol. 114(C).
    12. Xu, Yifan & Wandelt, Sebastian & Sun, Xiaoqian, 2021. "Airline integrated robust scheduling with a variable neighborhood search based heuristic," Transportation Research Part B: Methodological, Elsevier, vol. 149(C), pages 181-203.
    13. Panta Lučić & Dušan Teodorović, 2007. "Metaheuristics approach to the aircrew rostering problem," Annals of Operations Research, Springer, vol. 155(1), pages 311-338, November.
    14. Darby-Dowman, K. & Fink, R. K. & Mitra, G. & Smith, J. W., 1995. "An intelligent system for US Coast Guard cutter scheduling," European Journal of Operational Research, Elsevier, vol. 87(3), pages 574-585, December.
    15. Abbink, E.J.W., 2008. "Solving large scale crew scheduling problems by using iterative partitioning," Econometric Institute Research Papers EI 2008-03, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    16. Gerald G. Brown & Robert F. Dell & Ray L. Davis & Richard H. Duff, 2002. "Optimizing Plant-Line Schedules and an Application at Hidden Valley Manufacturing Company," Interfaces, INFORMS, vol. 32(3), pages 1-14, June.
    17. Michael Jünger & Sven Mallach, 2021. "Exact Facetial Odd-Cycle Separation for Maximum Cut and Binary Quadratic Optimization," INFORMS Journal on Computing, INFORMS, vol. 33(4), pages 1419-1430, October.
    18. Manfred Padberg, 2005. "Classical Cuts for Mixed-Integer Programming and Branch-and-Cut," Annals of Operations Research, Springer, vol. 139(1), pages 321-352, October.
    19. Bredström, David & Jörnsten, Kurt & Rönnqvist, Mikael, 2007. "Searching for optimal integer solutions to set partitioning problems using column generation," Discussion Papers 2007/20, Norwegian School of Economics, Department of Business and Management Science.
    20. Bjorndal, M. H. & Caprara, A. & Cowling, P. I. & Della Croce, F. & Lourenco, H. & Malucelli, F. & Orman, A. J. & Pisinger, D. & Rego, C. & Salazar, J. J., 1995. "Some thoughts on combinatorial optimisation," European Journal of Operational Research, Elsevier, vol. 83(2), pages 253-270, June.

    More about this item

    Statistics

    Access and download statistics

    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:120:y:2000:i:1:p:81-96. 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.