IDEAS home Printed from https://ideas.repec.org/a/taf/tjorxx/v73y2022i2p430-444.html
   My bibliography  Save this article

Optimal berth scheduling and sequencing under unexpected events

Author

Listed:
  • Abbas Al-Refaie
  • Hala Abedalqader

Abstract

The berth scheduling problem (BSP) at container ports has received significant research attention. Nevertheless, few studies considered the BSP under emergent ship arrivals. Thus, this paper proposes an optimization procedure for scheduling and sequencing of ship arrivals at container port under the occurrence of unexpected events; emergent ship arrivals. Three consecutive models are proposed to maximize the number of served emergent ships at minimal disturbance to service schedule of regular ships. The first model schedules and sequences service of emergent ships at available idle berth(s). The remaining unscheduled emergent ships are then assigned by the second model, which attempts to serve those ships in untapped ranges between the scheduled regular ships. If some emergent ships are still unassigned in the untapped ranges, the third model finally resequences the service schedule of regular ships at the berth of the largest free margin to serve those emergent ships. A case study is employed to illustrate the proposed optimization procedure; where the results showed that the proposed models efficiently solved BSP at acceptable satisfaction levels for both regular and emergent ships. In conclusion, the proposed models may provide valuable support to decision makers in dealing with BSP under emergent ship arrivals.

Suggested Citation

  • Abbas Al-Refaie & Hala Abedalqader, 2022. "Optimal berth scheduling and sequencing under unexpected events," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 73(2), pages 430-444, March.
  • Handle: RePEc:taf:tjorxx:v:73:y:2022:i:2:p:430-444
    DOI: 10.1080/01605682.2020.1843981
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/01605682.2020.1843981
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/01605682.2020.1843981?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.

    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:taf:tjorxx:v:73:y:2022:i:2:p:430-444. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/tjor .

    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.