scientific article
From MaRDI portal
Publication:3670906
zbMath0521.90058MaRDI QIDQ3670906
Publication date: 1983
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
simulation resultspolynomial timedemand and capacity constraintsfour step algorithmgeneralized heuristic techniquegeneralized multi-item lot size-schedulingNP-complete production planning
Analysis of algorithms and problem complexity (68Q25) Applications of mathematical programming (90C90) Deterministic scheduling theory in operations research (90B35) Production models (90B30) Inventory, storage, reservoirs (90B05)
Related Items (1)
Cites Work
- Unnamed Item
- Production scheduling and sequencing for multi-stage production systems
- Considerations on the requirements matrix of a non-regular school time- table problem
- Dynamic Version of the Economic Lot Size Model
- Deterministic Production Planning: Algorithms and Complexity
- An Algorithm for the Dynamic Lot-Size Problem with Time-Varying Production Capacity Constraints
- A Lower Bounding Structure for Lot-Size Scheduling Problems
- Multi-Item Lot Size Scheduling by Heuristic Part I: With Fixed Resources
- Deterministic Production Planning with Concave Costs and Capacity Constraints
- A Dynamic Programming Approach to a Lot Size Scheduling Problem
- A Deterministic Multiproduct, Multi-Facility Production and Inventory Model
- Minimum Concave Cost Flows in Certain Networks
- A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System—A Network Approach
- An Implicit Enumeration Algorithm for the Concave Cost Network Flow Problem
This page was built for publication:
