Scheduling of inventory releasing jobs to minimize a regular objective function of delivery times

Authors:
Márton Drótos;Tamás Kis
Affiliations:
Computer and Automation Research Institute, Hungarian Academy of Sciences, Budapest, Hungary H1111;Computer and Automation Research Institute, Hungarian Academy of Sciences, Budapest, Hungary H1111
Venue:
Journal of Scheduling
Year:
2013

Citing 4
Cited 1

Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Scheduling subject to nonrenewable-resource constraints

Operations Research Letters
Exact algorithms for inventory constrained scheduling on a single machine

Journal of Scheduling
Scheduling of inventory releasing jobs to satisfy time-varying demand: an analysis of complexity

Journal of Scheduling

Approximation schemes for single machine scheduling with non-renewable resource constraints

Journal of Scheduling

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this note we provide new complexity and algorithmic results for scheduling inventory releasing jobs, a new class of single machine scheduling problems proposed recently by Boysen et al. We focus on tardiness related criteria, while known results are concerned with inventory levels between fixed delivery points. Our interest is motivated by the fact that deciding whether a feasible schedule exists is NP-hard in the strong sense, provided that all delivery deadlines are fixed, and there are no restrictions on the amount of products released by the jobs, nor on the job processing times. We will establish NP-hardness results, or provide polynomial or pseudo-polynomial time algorithms for various special cases, and describe a fully polynomial approximation scheme for one of the variants with the maximum tardiness criterion.