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

An integrated model for multi-resource constrained scheduling problem considering multi-product and resource-sharing

Author

Listed:
  • Changchun Liu
  • Xi Xiang
  • Li Zheng
  • Jing Ma

Abstract

This paper studies a multi-resource constrained scheduling problem considering multi-product and resource-sharing in the manufacturing supply chain, in which many independent production units coordinate with a truck resource manager. A mixed integer programming model is formulated to minimise the total system cost and some analytical properties are proposed to tighten the model. A Lagrangian relaxation-based heuristic with several enhancements, e.g. warm startup, approximating solve and parallel computation of subproblems, is proposed to solve the model. Finally, computational experiments are conducted to verify that (i) the proposed method has a better performance in both objective and CPU time than CPLEX, (ii) all three enhancements can help reduce the total computation time and (iii) a certain degree of resource-sharing can help reduce the total cost of the system.

Suggested Citation

  • Changchun Liu & Xi Xiang & Li Zheng & Jing Ma, 2018. "An integrated model for multi-resource constrained scheduling problem considering multi-product and resource-sharing," International Journal of Production Research, Taylor & Francis Journals, vol. 56(19), pages 6491-6511, October.
    • Handle: RePEc:taf:tprsxx:v:56:y:2018:i:19:p:6491-6511
    DOI: 10.1080/00207543.2017.1363428
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2017.1363428
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207543.2017.1363428?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:56:y:2018:i:19:p:6491-6511. 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.