IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v63y2015i4p729-755.html
   My bibliography  Save this article

A Branch-and-Cut algorithm for factory crane scheduling problem

Author

Listed:
  • Xu Cheng
  • Lixin Tang
  • Panos Pardalos

Abstract

The factory crane scheduling problem (FCSP) deals with assigning delivery tasks to cranes and then sequencing them, in order to minimize the total completion time for all tasks. In this paper, delivery tasks for required jobs are preemptive allowed at most once before the jobs arrive at exit. The preemptive jobs are temporarily stored in a buffer stack, in which jobs pickup and delivery should be performed under the Last-In-First-Out policy. This feature makes our problem more changeling and interesting. In this paper, FCSP is first formulated as an integer programming model. Based on properties of the problem, FCSP is then reformulated with a much tighter bound. After that, several families of valid inequalities are proposed and used within a Branch-and-Cut framework. In addition, preprocessing techniques and separation heuristics are used to improve algorithm efficiency. Computational experiments are carried out on practical data collected from the steel company. The results support both effectiveness and efficiency of the model refinements as well as the Branch-and-Cut algorithm proposed. Copyright Springer Science+Business Media New York 2015

Suggested Citation

  • Xu Cheng & Lixin Tang & Panos Pardalos, 2015. "A Branch-and-Cut algorithm for factory crane scheduling problem," Journal of Global Optimization, Springer, vol. 63(4), pages 729-755, December.
    • Handle: RePEc:spr:jglopt:v:63:y:2015:i:4:p:729-755
    DOI: 10.1007/s10898-015-0285-4
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10898-015-0285-4
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10898-015-0285-4?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. Ng, W. C., 2005. "Crane scheduling in container yards with inter-crane interference," European Journal of Operational Research, Elsevier, vol. 164(1), pages 64-78, July.
    2. Petersen, Hanne L. & Madsen, Oli B.G., 2009. "The double travelling salesman problem with multiple stacks - Formulation and heuristic solution approaches," European Journal of Operational Research, Elsevier, vol. 198(1), pages 139-147, October.
    3. Manuel Iori & Juan-José Salazar-González & Daniele Vigo, 2007. "An Exact Approach for the Vehicle Routing Problem with Two-Dimensional Loading Constraints," Transportation Science, INFORMS, vol. 41(2), pages 253-264, May.
    4. Jean-François Cordeau, 2006. "A Branch-and-Cut Algorithm for the Dial-a-Ride Problem," Operations Research, INFORMS, vol. 54(3), pages 573-586, June.
    5. Hang Xu & Zhi-Long Chen & Srinivas Rajagopal & Sundar Arunapuram, 2003. "Solving a Practical Pickup and Delivery Problem," Transportation Science, INFORMS, vol. 37(3), pages 347-364, 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. Gabriela N. Maschietto & Yassine Ouazene & Martín G. Ravetti & Maurício C. de Souza & Farouk Yalaoui, 2017. "Crane scheduling problem with non-interference constraints in a steel coil distribution centre," International Journal of Production Research, Taylor & Francis Journals, vol. 55(6), pages 1607-1622, March.

    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. Cherkesly, Marilène & Gschwind, Timo, 2022. "The pickup and delivery problem with time windows, multiple stacks, and handling operations," European Journal of Operational Research, Elsevier, vol. 301(2), pages 647-666.
    2. Männel, Dirk & Bortfeldt, Andreas, 2016. "A hybrid algorithm for the vehicle routing problem with pickup and delivery and three-dimensional loading constraints," European Journal of Operational Research, Elsevier, vol. 254(3), pages 840-858.
    3. Schmid, Verena & Doerner, Karl F. & Laporte, Gilbert, 2013. "Rich routing problems arising in supply chain management," European Journal of Operational Research, Elsevier, vol. 224(3), pages 435-448.
    4. Felipe, Angel & Teresa Ortuño, M. & Tirado, Gregorio, 2011. "Using intermediate infeasible solutions to approach vehicle routing problems with precedence and loading constraints," European Journal of Operational Research, Elsevier, vol. 211(1), pages 66-75, May.
    5. Lars Magnus Hvattum & Gregorio Tirado & Ángel Felipe, 2020. "The Double Traveling Salesman Problem with Multiple Stacks and a Choice of Container Types," Mathematics, MDPI, vol. 8(6), pages 1-11, June.
    6. Guo, Jiaqi & Long, Jiancheng & Xu, Xiaoming & Yu, Miao & Yuan, Kai, 2022. "The vehicle routing problem of intercity ride-sharing between two cities," Transportation Research Part B: Methodological, Elsevier, vol. 158(C), pages 113-139.
    7. Hanne Pollaris & Kris Braekers & An Caris & Gerrit K. Janssens & Sabine Limbourg, 2016. "Capacitated vehicle routing problem with sequence-based pallet loading and axle weight constraints," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 5(2), pages 231-255, June.
    8. Carlos A. Vega-Mejía & Jairo R. Montoya-Torres & Sardar M. N. Islam, 2019. "Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review," Annals of Operations Research, Springer, vol. 273(1), pages 311-375, February.
    9. Liu, Ran & Xie, Xiaolan & Augusto, Vincent & Rodriguez, Carlos, 2013. "Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care," European Journal of Operational Research, Elsevier, vol. 230(3), pages 475-486.
    10. Cherkesly, Marilène & Desaulniers, Guy & Irnich, Stefan & Laporte, Gilbert, 2016. "Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks," European Journal of Operational Research, Elsevier, vol. 250(3), pages 782-793.
    11. Cortés, Cristián E. & Matamala, Martín & Contardo, Claudio, 2010. "The pickup and delivery problem with transfers: Formulation and a branch-and-cut solution method," European Journal of Operational Research, Elsevier, vol. 200(3), pages 711-724, February.
    12. Ulf Speer & Kathrin Fischer, 2017. "Scheduling of Different Automated Yard Crane Systems at Container Terminals," Transportation Science, INFORMS, vol. 51(1), pages 305-324, February.
    13. Jean-François Côté & Manuel Iori, 2018. "The Meet-in-the-Middle Principle for Cutting and Packing Problems," INFORMS Journal on Computing, INFORMS, vol. 30(4), pages 646-661, November.
    14. Gong, Manlin & Hu, Yucong & Chen, Zhiwei & Li, Xiaopeng, 2021. "Transfer-based customized modular bus system design with passenger-route assignment optimization," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 153(C).
    15. Detti, Paolo & Papalini, Francesco & Lara, Garazi Zabalo Manrique de, 2017. "A multi-depot dial-a-ride problem with heterogeneous vehicles and compatibility constraints in healthcare," Omega, Elsevier, vol. 70(C), pages 1-14.
    16. Bonet Filella, Guillem & Trivella, Alessio & Corman, Francesco, 2023. "Modeling soft unloading constraints in the multi-drop container loading problem," European Journal of Operational Research, Elsevier, vol. 308(1), pages 336-352.
    17. Dirk Briskorn & Lennart Zey, 2018. "Resolving interferences of triple‐crossover‐cranes by determining paths in networks," Naval Research Logistics (NRL), John Wiley & Sons, vol. 65(6-7), pages 477-498, September.
    18. Shangyao Yan & Chun-Ying Chen & Chuan-Che Wu, 2012. "Solution methods for the taxi pooling problem," Transportation, Springer, vol. 39(3), pages 723-748, May.
    19. Malaguti, Enrico & Martello, Silvano & Santini, Alberto, 2018. "The traveling salesman problem with pickups, deliveries, and draft limits," Omega, Elsevier, vol. 74(C), pages 50-58.
    20. Bayliss, Christopher & Currie, Christine S.M. & Bennell, Julia A. & Martinez-Sykora, Antonio, 2021. "Queue-constrained packing: A vehicle ferry case study," European Journal of Operational Research, Elsevier, vol. 289(2), pages 727-741.

    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:jglopt:v:63:y:2015:i:4:p:729-755. 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.