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

A parallel machine lot-sizing and scheduling problem with a secondary resource and cumulative demand

Author

Listed:
  • Murat Güngör
  • Ali Tamer Ünal
  • Z. Caner Taşkın

Abstract

We investigate a parallel machine multi-item lot-sizing and scheduling problem with a secondary resource, in which demands are given for the entire planning horizon rather than for every single period. All-or-nothing assumption of the discrete lot-sizing and scheduling problem is valid so that a machine is either idle or works at full capacity in a period. The objective is to minimise the number of setups and teardowns. We prove that the problem is NP-hard and present two equivalent formulations. We show some properties of the optimal objective value, give optimality conditions and suggest a heuristic algorithm. We discuss and formulate two possible extensions related to real-life applications. Finally, we carry out computational experiments to compare the two formulations, to determine the effect of our proposed modeling improvements on solution performance, and to test the quality of our heuristic.

Suggested Citation

  • Murat Güngör & Ali Tamer Ünal & Z. Caner Taşkın, 2018. "A parallel machine lot-sizing and scheduling problem with a secondary resource and cumulative demand," International Journal of Production Research, Taylor & Francis Journals, vol. 56(9), pages 3344-3357, May.
    • Handle: RePEc:taf:tprsxx:v:56:y:2018:i:9:p:3344-3357
    DOI: 10.1080/00207543.2017.1406675
    as

    Download full text from publisher

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