IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v62y2024i24p8633-8650.html
   My bibliography  Save this article

Appointment scheduling for logistics parks under truck heterogeneity and order fulfillment delay

Author

Listed:
  • Yujiao Sun
  • Shirui Zeng
  • Wenhui Zhou
  • Yangguang Lu
  • Yuanguang Zhong

Abstract

Appointment scheduling is critical for logistic parks of manufacturing industry firms to manage inventory turnover and schedule service objects. This work studies the appointment scheduling problem of a logistic park considering truck heterogeneity and order fulfillment delay, where the number of time windows in a day, the number of each type of appointment slot, and the service schedule in each time window are decided. The objective is to minimise the expected total cost of the truck waiting time, inventory, and overtime. We introduce a weighted shortest processing time first scheduling rule to determine the service sequence in each time window and prove that it generates optimal scheduling solutions. Based on our proposed scheduling rule, we develop a recursive calculation to formulate the cost function, which provides a tractable approach to solving combinatorially complex problems. The proposed model is solved by a dual-selection based genetic algorithm (DSGA). The performance of the DSGA is validated by comparing it to a genetic algorithm using a single tournament selection operation. Our experimental results show that the DSGA enlarges the size of subgroups with better fitness and therefore performs satisfactorily.

Suggested Citation

  • Yujiao Sun & Shirui Zeng & Wenhui Zhou & Yangguang Lu & Yuanguang Zhong, 2024. "Appointment scheduling for logistics parks under truck heterogeneity and order fulfillment delay," International Journal of Production Research, Taylor & Francis Journals, vol. 62(24), pages 8633-8650, December.
  • Handle: RePEc:taf:tprsxx:v:62:y:2024:i:24:p:8633-8650
    DOI: 10.1080/00207543.2024.2347557
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1080/00207543.2024.2347557?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:tprsxx:v:62:y:2024:i:24:p:8633-8650. 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/TPRS20 .

    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.