IDEAS home Printed from https://ideas.repec.org/a/taf/uiiexx/v42y2010i7p514-524.html
   My bibliography  Save this article

Multi-product lot sizing and scheduling on unrelated parallel machines

Author

Listed:
  • Alexandre Dolgui
  • Anton Eremeev
  • Mikhail Kovalyov
  • Pavel Kuznetsov

Abstract

This article studies a problem of optimal scheduling and lot sizing a number of products on m unrelated parallel machines to satisfy given demands. A sequence-dependent setup time is required between lots of different products. The products are assumed to be all continuously divisible or all discrete. The criterion is to minimize the time at which all the demands are satisfied, Cmax, or the maximum lateness of the product completion times from the given due dates, Lmax. The problem is motivated by the real-life scheduling applications in multi-product plants. The properties of optimal solutions, NP-hardness proofs, enumeration, and dynamic programming algorithms for various special cases of the problem are presented. A greedy-type heuristic is proposed and experimentally tested. The major contributions are an NP-hardness proof, pseudo-polynomial algorithms linear in m for the case, in which the number of products is a given constant and the heuristic. The results can be adapted for solving a production line design problem.

Suggested Citation

  • Alexandre Dolgui & Anton Eremeev & Mikhail Kovalyov & Pavel Kuznetsov, 2010. "Multi-product lot sizing and scheduling on unrelated parallel machines," IISE Transactions, Taylor & Francis Journals, vol. 42(7), pages 514-524.
    • Handle: RePEc:taf:uiiexx:v:42:y:2010:i:7:p:514-524
    DOI: 10.1080/07408170903542649
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/07408170903542649
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/07408170903542649?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. Simon Thevenin & Nicolas Zufferey & Rémy Glardon, 2017. "Model and metaheuristics for a scheduling problem integrating procurement, sale and distribution decisions," Annals of Operations Research, Springer, vol. 259(1), pages 437-460, December.
    2. Yu-Wei An & Hong-Sen Yan, 2016. "Lagrangean relaxation approach to joint optimization for production planning and scheduling of synchronous assembly lines," International Journal of Production Research, Taylor & Francis Journals, vol. 54(22), pages 6718-6735, November.
    3. Schemeleva, Kseniya & Delorme, Xavier & Dolgui, Alexandre, 2018. "Evaluation of solution approaches for a stochastic lot-sizing and sequencing problem," International Journal of Production Economics, Elsevier, vol. 199(C), pages 179-192.
    4. Kopanos, Georgios M. & Puigjaner, Luis & Georgiadis, Michael C., 2012. "Simultaneous production and logistics operations planning in semicontinuous food industries," Omega, Elsevier, vol. 40(5), pages 634-650.

    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:uiiexx:v:42:y:2010:i:7:p:514-524. 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/uiie .

    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.