Scheduling of inventory releasing jobs to satisfy time-varying demand
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.
|Date of creation:||2011|
|Date of revision:|
|Publication status:||Published in: Journal of Scheduling 16/2 (2013), 185-198.|
|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.wiwiss.uni-jena.de/index.html
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.|
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 references are entirely missing, you can add them using this form.