Advanced Search
MyIDEAS: Login to save this paper or follow this series

Scheduling of inventory releasing jobs to satisfy time-varying demand

Contents:

Author Info

  • 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)

Abstract

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.

Download Info

If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
File URL: http://dx.doi.org/10.1007/s10951-012-0266-0
Download Restriction: no

Bibliographic Info

Paper provided by Friedrich-Schiller-University Jena, School of Economics and Business Administration in its series Jena Research Papers in Business and Economics - Working and Discussion Papers with number 02/2011.

as in new window
Length:
Date of creation: 2011
Date of revision:
Publication status: Published in: Journal of Scheduling 16/2 (2013), 185-198.
Handle: RePEc:jen:jenjbe:2011-02

Contact details of provider:
Postal: Carl-Zeiss-Strasse 3, 07743 JENA
Phone: +049 3641/ 9 43000
Fax: +049 3641/ 9 43000
Web page: http://www.wiwi.uni-jena.de/
More information through EDIRC

Order Information:
Postal: If a paper is not downloadable, please contact the author(s) or the library of University of Jena, not the archive maintainer.

Related research

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

This paper has been announced in the following NEP Reports:

References

No references listed on IDEAS
You can help add them by filling out this form.

Citations

Lists

This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

Statistics

Access and download statistics

Corrections

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: ().

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.

If references are entirely missing, you can add them using this form.

If the full references list an item that is present in RePEc, but the system did not link to it, you can help with 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 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.