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

Machine scheduling with soft precedence constraints

Author

Listed:
  • Zhang, An
  • Qi, Xiangtong
  • Li, Guanhua

Abstract

This paper introduces a new concept, soft precedence constraint (SPC), in machine scheduling problems. Similar to the conventional precedence constraint, SPC specifies some partial order over the jobs; however, an SPC can be violated, but with a certain penalty or cost. The scheduling problem is to balance the tradeoff between the SPC violation penalty and other criteria relative to job completion times. We focus on studying a special case where SPC is defined by a bipartite network. This case is motivated by the berth allocation problem at a transshipment port, where the SPC models any missed container connections from feeder vessels to ocean-going vessels. We discuss the complexity of the problems for different scenarios and develop approximation algorithms.

Suggested Citation

  • Zhang, An & Qi, Xiangtong & Li, Guanhua, 2020. "Machine scheduling with soft precedence constraints," European Journal of Operational Research, Elsevier, vol. 282(2), pages 491-505.
    • Handle: RePEc:eee:ejores:v:282:y:2020:i:2:p:491-505
    DOI: 10.1016/j.ejor.2019.09.041
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221719307982
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2019.09.041?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. Bierwirth, Christian & Meisel, Frank, 2015. "A follow-up survey of berth allocation and quay crane scheduling problems in container terminals," European Journal of Operational Research, Elsevier, vol. 244(3), pages 675-689.
    2. Bierwirth, Christian & Meisel, Frank, 2010. "A survey of berth allocation and quay crane scheduling problems in container terminals," European Journal of Operational Research, Elsevier, vol. 202(3), pages 615-627, May.
    3. J. K. Lenstra & A. H. G. Rinnooy Kan, 1978. "Complexity of Scheduling under Precedence Constraints," Operations Research, INFORMS, vol. 26(1), pages 22-35, February.
    4. Eun-Seok Kim & Marc Posner, 2010. "Parallel machine scheduling with s-precedence constraints," IISE Transactions, Taylor & Francis Journals, vol. 42(7), pages 525-537.
    5. D. Prot & O. Bellenguez-Morineau, 2018. "A survey on how the structure of precedence constraints may change the complexity class of scheduling problems," Journal of Scheduling, Springer, vol. 21(1), pages 3-16, February.
    6. Lee, Der-Horng & Jin, Jian Gang, 2013. "Feeder vessel management at container transshipment terminals," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 49(1), pages 201-216.
    7. Brouer, Berit D. & Dirksen, Jakob & Pisinger, David & Plum, Christian E.M. & Vaaben, Bo, 2013. "The Vessel Schedule Recovery Problem (VSRP) – A MIP model for handling disruptions in liner shipping," European Journal of Operational Research, Elsevier, vol. 224(2), pages 362-374.
    8. Chen Li & Xiangtong Qi & Chung-Yee Lee, 2015. "Disruption Recovery for a Vessel in Liner Shipping," Transportation Science, INFORMS, vol. 49(4), pages 900-921, November.
    9. Simon Emde & Nils Boysen, 2016. "Berth allocation in container terminals that service feeder ships and deep-sea vessels," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 67(4), pages 551-563, April.
    10. Li, Chen & Qi, Xiangtong & Song, Dongping, 2016. "Real-time schedule recovery in liner shipping service with regular uncertainties and disruption events," Transportation Research Part B: Methodological, Elsevier, vol. 93(PB), pages 762-788.
    11. Tao, Yi & Lee, Chung-Yee, 2015. "Joint planning of berth and yard allocation in transshipment terminals using multi-cluster stacking strategy," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 83(C), pages 34-50.
    12. Buhrkal, Katja & Zuglian, Sara & Ropke, Stefan & Larsen, Jesper & Lusby, Richard, 2011. "Models for the discrete berth allocation problem: A computational comparison," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 47(4), pages 461-473, July.
    13. Lu Zhen & Ek Peng Chew & Loo Hay Lee, 2011. "An Integrated Model for Berth Template and Yard Template Planning in Transshipment Hubs," Transportation Science, INFORMS, vol. 45(4), pages 483-504, November.
    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. Mina Roohnavazfar & Seyed Hamid Reza Pasandideh, 2022. "Decomposition algorithm for the multi-trip single vehicle routing problem with AND-type precedence constraints," Operational Research, Springer, vol. 22(4), pages 4253-4285, September.
    2. Raeesi, Ramin & Sahebjamnia, Navid & Mansouri, S. Afshin, 2023. "The synergistic effect of operational research and big data analytics in greening container terminal operations: A review and future directions," European Journal of Operational Research, Elsevier, vol. 310(3), pages 943-973.
    3. Ma, Ran & Guo, Sainan, 2021. "Applying “Peeling Onion” approach for competitive analysis in online scheduling with rejection," European Journal of Operational Research, Elsevier, vol. 290(1), pages 57-67.
    4. Luo, Kaiping & Shen, Guangya & Li, Liheng & Sun, Jianfei, 2023. "0-1 mathematical programming models for flexible process planning," European Journal of Operational Research, Elsevier, vol. 308(3), pages 1160-1175.

    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. Zhen, Lu & Zhuge, Dan & Wang, Shuaian & Wang, Kai, 2022. "Integrated berth and yard space allocation under uncertainty," Transportation Research Part B: Methodological, Elsevier, vol. 162(C), pages 1-27.
    2. Kai Wang & Lu Zhen & Shuaian Wang, 2018. "Column Generation for the Integrated Berth Allocation, Quay Crane Assignment, and Yard Assignment Problem," Transportation Science, INFORMS, vol. 52(4), pages 812-834, August.
    3. Liu, Ming & Lee, Chung-Yee & Zhang, Zizhen & Chu, Chengbin, 2016. "Bi-objective optimization for the container terminal integrated planning," Transportation Research Part B: Methodological, Elsevier, vol. 93(PB), pages 720-749.
    4. Dongping Song, 2021. "A Literature Review, Container Shipping Supply Chain: Planning Problems and Research Opportunities," Logistics, MDPI, vol. 5(2), pages 1-26, June.
    5. Liu, Baoli & Li, Zhi-Chun & Sheng, Dian & Wang, Yadong, 2021. "Integrated planning of berth allocation and vessel sequencing in a seaport with one-way navigation channel," Transportation Research Part B: Methodological, Elsevier, vol. 143(C), pages 23-47.
    6. Robenek, Tomáš & Umang, Nitish & Bierlaire, Michel & Ropke, Stefan, 2014. "A branch-and-price algorithm to solve the integrated berth allocation and yard assignment problem in bulk ports," European Journal of Operational Research, Elsevier, vol. 235(2), pages 399-411.
    7. Wawrzyniak, Jakub & Drozdowski, Maciej & Sanlaville, Éric, 2020. "Selecting algorithms for large berth allocation problems," European Journal of Operational Research, Elsevier, vol. 283(3), pages 844-862.
    8. Gharehgozli, A.H. & Roy, D. & de Koster, M.B.M., 2014. "Sea Container Terminals," ERIM Report Series Research in Management ERS-2014-009-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.
    9. Fanrui Xie & Tao Wu & Canrong Zhang, 2019. "A Branch-and-Price Algorithm for the Integrated Berth Allocation and Quay Crane Assignment Problem," Transportation Science, INFORMS, vol. 53(5), pages 1427-1454, September.
    10. Jia, Shuai & Li, Chung-Lun & Xu, Zhou, 2020. "A simulation optimization method for deep-sea vessel berth planning and feeder arrival scheduling at a container port," Transportation Research Part B: Methodological, Elsevier, vol. 142(C), pages 174-196.
    11. Maxim A. Dulebenets & Junayed Pasha & Olumide F. Abioye & Masoud Kavoosi, 2021. "Vessel scheduling in liner shipping: a critical literature review and future research needs," Flexible Services and Manufacturing Journal, Springer, vol. 33(1), pages 43-106, March.
    12. H. L. Ma & S. H. Chung & H. K. Chan & Li Cui, 2019. "An integrated model for berth and yard planning in container terminals with multi-continuous berth layout," Annals of Operations Research, Springer, vol. 273(1), pages 409-431, February.
    13. Liu, Changchun, 2020. "Iterative heuristic for simultaneous allocations of berths, quay cranes, and yards under practical situations," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 133(C).
    14. Xiang, Xi & Liu, Changchun, 2021. "An expanded robust optimisation approach for the berth allocation problem considering uncertain operation time," Omega, Elsevier, vol. 103(C).
    15. Guo, Peng & Weidinger, Felix & Boysen, Nils, 2019. "Parallel machine scheduling with job synchronization to enable efficient material flows in hub terminals," Omega, Elsevier, vol. 89(C), pages 110-121.
    16. Bierwirth, Christian & Meisel, Frank, 2015. "A follow-up survey of berth allocation and quay crane scheduling problems in container terminals," European Journal of Operational Research, Elsevier, vol. 244(3), pages 675-689.
    17. Eduardo Lalla-Ruiz & Stefan Voß & Christopher Expósito-Izquierdo & Belén Melián-Batista & J. Marcos Moreno-Vega, 2017. "A POPMUSIC-based approach for the berth allocation problem under time-dependent limitations," Annals of Operations Research, Springer, vol. 253(2), pages 871-897, June.
    18. Guo, Liming & Zheng, Jianfeng & Liang, Jinpeng & Wang, Shuaian, 2023. "Column generation for the multi-port berth allocation problem with port cooperation stability," Transportation Research Part B: Methodological, Elsevier, vol. 171(C), pages 3-28.
    19. Rupp, Johannes & Boysen, Nils & Briskorn, Dirk, 2022. "Optimizing consolidation processes in hubs: The hub-arrival-departure problem," European Journal of Operational Research, Elsevier, vol. 298(3), pages 1051-1066.
    20. Lee, Chung-Yee & Song, Dong-Ping, 2017. "Ocean container transport in global supply chains: Overview and research opportunities," Transportation Research Part B: Methodological, Elsevier, vol. 95(C), pages 442-474.

    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:282:y:2020:i:2:p:491-505. 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.