IDEAS home Printed from https://ideas.repec.org/a/bla/stanee/v61y2007i1p75-91.html
   My bibliography  Save this article

Multiplicity and complexity issues in contemporary production scheduling

Author

Listed:
  • N. Brauner
  • Y. Crama
  • A. Grigoriev
  • J. Van De Klundert

Abstract

High multiplicity scheduling problems arise naturally in contemporary production settings where manufacturers combine economies of scale with high product variety. Despite their frequent occurrence in practice, the complexity of high multiplicity problems – as opposed to classical, single multiplicity problems – is in many cases not well understood. In this paper, we discuss various concepts and results that enable a better understanding of the nature and complexity of high multiplicity scheduling problems. The paper extends the framework presented in Brauneret al. [Journal of Combinatorial Optimization (2005) Vol. 9, pp. 313–323] for single machine, non‐preemptive high multiplicity scheduling problems, to more general classes of problems.

Suggested Citation

  • N. Brauner & Y. Crama & A. Grigoriev & J. Van De Klundert, 2007. "Multiplicity and complexity issues in contemporary production scheduling," Statistica Neerlandica, Netherlands Society for Statistics and Operations Research, vol. 61(1), pages 75-91, February.
    • Handle: RePEc:bla:stanee:v:61:y:2007:i:1:p:75-91
    DOI: 10.1111/j.1467-9574.2007.00362.x
    as

    Download full text from publisher

    File URL: https://doi.org/10.1111/j.1467-9574.2007.00362.x
    Download Restriction: no
    File URL: https://libkey.io/10.1111/j.1467-9574.2007.00362.x?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
    ---><---

    Citations

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


    Cited by:

    1. Cheng, T.C.E. & Shafransky, Y. & Ng, C.T., 2016. "An alternative approach for proving the NP-hardness of optimization problems," European Journal of Operational Research, Elsevier, vol. 248(1), pages 52-58.
    2. Alexander Grigoriev & Vincent J. Kreuzen & Tim Oosterwijk, 2021. "Cyclic lot-sizing problems with sequencing costs," Journal of Scheduling, Springer, vol. 24(2), pages 123-135, April.

    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:bla:stanee:v:61:y:2007:i:1:p:75-91. 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: Wiley Content Delivery (email available below). General contact details of provider: http://www.blackwellpublishing.com/journal.asp?ref=0039-0402 .

    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.