IDEAS home Printed from
   My bibliography  Save this paper

Scheduling of inventory releasing jobs to satisfy time-varying demand


  • Nils Boysen

    () (School of Economics and Business Administration, Friedrich-Schiller-University Jena)

  • Stefan Bock
  • Malte Fliedner

    () (School of Economics and Business Administration, Friedrich-Schiller-University Jena)


This paper studies a new class of single-machine scheduling problems, that are faced by Just-in-Time-suppliers satisfying a given demand. In these models the processing of jobs leads to a release of a predefined number of product units into inventory. Consumption is triggered by predetermined time-varying, and product-specific demand requests. While all demands have to be fulfilled, the objective is to minimize the resulting product inventory. We investigate different subproblems of this general setting with regard to their computational complexity. For more restricted problem versions (equal processing times and equal number of released products) strongly polynomial time algorithms are presented. In contrast to this, NP-hardness in the strong sense is proven for more general problem versions (varying processing times or varying number of released products). Moreover, for the most general version, even finding a feasible solution is shown to be strongly NP-hard.

Suggested Citation

  • Nils Boysen & Stefan Bock & Malte Fliedner, 2011. "Scheduling of inventory releasing jobs to satisfy time-varying demand," Jena Research Papers in Business and Economics - Working and Discussion Papers (Expired!) 02/2011, Friedrich-Schiller-University Jena, School of Economics and Business Administration.
  • Handle: RePEc:jen:jenjbe:2011-02

    Download full text from publisher

    File URL:
    Download Restriction: no


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

    Cited by:

    1. Boysen, Nils & Emde, Simon, 2014. "Scheduling the part supply of mixed-model assembly lines in line-integrated supermarkets," European Journal of Operational Research, Elsevier, vol. 239(3), pages 820-829.

    More about this item


    Machine scheduling; Inventory; Time-varying demand; Computational complexity;

    NEP fields

    This paper has been announced in the following NEP Reports:


    Access and download statistics


    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:jen:jenjbe:2011-02. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (). General contact details of provider: .

    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 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.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.