IDEAS home Printed from https://ideas.repec.org/a/ids/ijlsma/v37y2020i2p225-238.html
   My bibliography  Save this article

Auction-based algorithm for solving scheduling problem in cross-docking centres

Author

Listed:
  • Eldho Paul
  • Brijesh Paul

Abstract

A cross-docking centre reduces the amount of storage and transportation in a distribution system compared to an ordinary warehouse. This paper proposes an auction-based mechanism for optimum scheduling of inbound trucks in cross-docking centres, thereby reducing the storage and transportation costs. Auction mechanisms are commonly used in different real life applications for better allocation of limited resources. Here, an effort is made to integrate the auction mechanism with the functioning of cross-docking centres. A mathematical model is developed for the optimal scheduling of inbound trucks. As expected, the determination of exact schedule for problems involving large number of variables was found to be computationally complex, and hence a heuristic methodology is also proposed in this study. In our computational experiments, we found that the proposed heuristic method is capable of producing good schedules in minimal time.

Suggested Citation

  • Eldho Paul & Brijesh Paul, 2020. "Auction-based algorithm for solving scheduling problem in cross-docking centres," International Journal of Logistics Systems and Management, Inderscience Enterprises Ltd, vol. 37(2), pages 225-238.
  • Handle: RePEc:ids:ijlsma:v:37:y:2020:i:2:p:225-238
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=110579
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:ids:ijlsma:v:37:y:2020:i:2:p:225-238. 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=134 .

    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.