Scheduling of inventory releasing jobs to minimize a regular objective function of delivery times
From MaRDI portal
Publication:2434321
DOI10.1007/s10951-012-0297-6zbMath1280.90041OpenAlexW2154051913MaRDI QIDQ2434321
Publication date: 5 February 2014
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: http://real.mtak.hu/26105/1/cumulres_rev1.pdf
Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Inventory, storage, reservoirs (90B05)
Related Items (6)
Minimising total tardiness for a single machine scheduling problem with family setups and resource constraints ⋮ Minimizing makespan on a single machine with release dates and inventory constraints ⋮ Approximation schemes for single machine scheduling with non-renewable resource constraints ⋮ Reductions between scheduling problems with non-renewable resources and knapsack problems ⋮ Approximability of total weighted completion time with resource consuming jobs ⋮ Part logistics in the automotive industry: decision problems, literature review and research agenda
Uses Software
Cites Work
- Unnamed Item
- Exact algorithms for inventory constrained scheduling on a single machine
- Complexity of single machine scheduling subject to nonnegative inventory constraints
- Scheduling subject to nonrenewable-resource constraints
- A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem
- Approximation algorithms for knapsack problems with cardinality constraints
- Project scheduling with inventory constraints
- Scheduling of inventory releasing jobs to satisfy time-varying demand: an analysis of complexity
- The Stock Size Problem
- Basic scheduling problems with raw material constraints
This page was built for publication: Scheduling of inventory releasing jobs to minimize a regular objective function of delivery times
