Scheduling of inventory releasing jobs to satisfy time-varying demand
Nils Boysen (),
Stefan Bock () and
Malte Fliedner ()
Additional contact information Nils Boysen: School of Economics and Business Administration, Friedrich-Schiller-University Jena, Postal: Carl-Zeiß-Straße 3, 07743 Jena, Germany
Malte Fliedner: School of Economics and Business Administration, Friedrich-Schiller-University Jena, Postal: Carl-Zeiß-Straße 3, 07743 Jena, Germany
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 predened number of product units into inventory. Consumption is triggered by predetermined time-varying, and product-specic demand requests. While all demands have to be fullled, 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.
Ordering information: This working paper can be ordered from If a paper is not downloadable, please contact the author(s) or the library of University of Jena, not the archive maintainer.