scientific article; zbMATH DE number 3825543

MaRDI QIDQ3670906zbMATH OpenFDO

Authors J.-C. Panayiotopoulos

Publication date 1983

zbMATH Keywords

simulation resultspolynomial timedemand and capacity constraintsfour step algorithmgeneralized heuristic techniquegeneralized multi-item lot size-schedulingNP-complete production planning

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Inventory, storage, reservoirs (90B05) Production models (90B30)

Cites work

• scientific article; zbMATH DE number 3310599 (Why is no real title available?)
• A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System—A Network Approach
• A Deterministic Multiproduct, Multi-Facility Production and Inventory Model
• A Dynamic Programming Approach to a Lot Size Scheduling Problem
• A Lower Bounding Structure for Lot-Size Scheduling Problems
• An Algorithm for the Dynamic Lot-Size Problem with Time-Varying Production Capacity Constraints
• An Implicit Enumeration Algorithm for the Concave Cost Network Flow Problem
• Considerations on the requirements matrix of a non-regular school time- table problem
• Deterministic Production Planning with Concave Costs and Capacity Constraints
• Deterministic Production Planning: Algorithms and Complexity
• Dynamic version of the economic lot size model
• Minimum Concave Cost Flows in Certain Networks
• Multi-Item Lot Size Scheduling by Heuristic Part I: With Fixed Resources
• Production scheduling and sequencing for multi-stage production systems

Cited in

(1)

• Heuristic methods and applications: A categorized survey

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3670906)