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

An advanced order batching approach for automated sequential auctions with forecasting and postponement

Author

Listed:
  • Xiang T. R. Kong
  • Miaohui Zhu
  • Yu Liu
  • Kaida Qin
  • George Q. Huang

Abstract

In sequential auctions, all the sub-orders from a buyer need to be sorted and consolidated within a short time window for shipping. Buyer demands and sub-order arrival times are uncertain. The current auction order fulfillment is facing several challenges. Based on a re-engineered Industrial Internet-of-Things (IIoT)-enabled automation system, this paper introduces an order batching approach with forecasting and postponement. Such an approach generates batches considering time interval and buyer completion rate to minimise the total processing time of the auction orders and system response time. The buyer completion rate refers to the ratio of current cumulative and predicted purchase quantity. We use the forecasting method proposed by Kong et al. (2021) to estimate the purchasing quantity. Through a series of computational experiments using real-life data, the proposed order batching method achieves a shorter order processing time and system response time. Results show that the number of auction buyers poses no effect on the performance of the proposed approach. Key parameters of order postponement rule influence on performance.

Suggested Citation

  • Xiang T. R. Kong & Miaohui Zhu & Yu Liu & Kaida Qin & George Q. Huang, 2023. "An advanced order batching approach for automated sequential auctions with forecasting and postponement," International Journal of Production Research, Taylor & Francis Journals, vol. 61(12), pages 4180-4195, June.
  • Handle: RePEc:taf:tprsxx:v:61:y:2023:i:12:p:4180-4195
    DOI: 10.1080/00207543.2021.2022234
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1080/00207543.2021.2022234?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:61:y:2023:i:12:p:4180-4195. 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.