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

Auction-based cooperation mechanism for cell part scheduling with transportation capacity constraint

Author

Listed:
  • Chengkuan Zeng
  • Jiafu Tang
  • Zhi-Ping Fan

Abstract

This paper addresses cell part scheduling (CPS) problem with transportation capacity constraint. In the problem, parts may need to visit different cells, they have to be transferred by automated guided vehicle (AGV). The objective is to minimise the over-all process make-span. An integer nonlinear programming (INLP) model is formulated to allocate the machines, AGVs and schedule all parts. A reasonable transportation mode is presented, and an auction-based heuristic approach is proposed to solve the problem, which focuses on dealing with cooperation between machines and AGVs during processing and transferring parts. The auction consists of two aspects: auction for AGV and auction for machine. In both auctions, AGVs and machines act as auctioneers respectively, and parts act as bidders. A new improved disjunctive graph model is developed to optimise the feasible solutions obtained by auction-based approach. Numerical experiments were conducted to test the auction-based approach and improved disjunctive graph model. The results demonstrate the effectiveness of proposed auction-based approach and improved disjunctive graph model, also indicate influence of the capacity of AGV on scheduling parts.

Suggested Citation

  • Chengkuan Zeng & Jiafu Tang & Zhi-Ping Fan, 2019. "Auction-based cooperation mechanism for cell part scheduling with transportation capacity constraint," International Journal of Production Research, Taylor & Francis Journals, vol. 57(12), pages 3831-3846, June.
    • Handle: RePEc:taf:tprsxx:v:57:y:2019:i:12:p:3831-3846
    DOI: 10.1080/00207543.2018.1513660
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2018.1513660
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207543.2018.1513660?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.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Hu, Yue & Yang, Hongbing & Huang, Yi, 2022. "Conflict-free scheduling of large-scale multi-load AGVs in material transportation network," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 158(C).

    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:57:y:2019:i:12:p:3831-3846. 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.