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

Order processing task allocation and scheduling for E-order fulfilment

Author

Listed:
  • Nan Chen
  • Wenxuan Kang
  • Ningxuan Kang
  • Yongzhi Qi
  • Hao Hu

Abstract

This paper mainly studies a task allocation and scheduling problem in the multi-thread fulfilment process of electronic order, which seeks to minimise the makespan under thread constraints and order precedence constraints. The problem is formulated as a Mixed Integer Programming (MIP) model and a novel depth-first heuristic is proposed to solve it. The depth-first heuristic shows high effectiveness and efficiency, compared with the current policy and the genetic algorithm in both small/medium-scale and large-scale cases from the real transaction data. In addition, two extensions on precedence constraint reduction and resource allocation are discussed to further improve and manage the e-order fulfilment process.

Suggested Citation

  • Nan Chen & Wenxuan Kang & Ningxuan Kang & Yongzhi Qi & Hao Hu, 2022. "Order processing task allocation and scheduling for E-order fulfilment," International Journal of Production Research, Taylor & Francis Journals, vol. 60(13), pages 4253-4267, July.
    • Handle: RePEc:taf:tprsxx:v:60:y:2022:i:13:p:4253-4267
    DOI: 10.1080/00207543.2021.2018140
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2021.2018140
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207543.2021.2018140?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:60:y:2022:i:13:p:4253-4267. 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.