A dynamic production planning and scheduling algorithm for two products processed on one line
DOI10.1016/0377-2217(84)90130-9zbMath0547.90041OpenAlexW1996443567MaRDI QIDQ799234
Publication date: 1984
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(84)90130-9
schedulingfinite planning horizonimplicit enumerationtwo productsdynamic production planningnonlinear binary programone machinetime-varying deterministic demandtotal revenue
Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35) Production models (90B30) Boolean programming (90C09)
Related Items (2)
Cites Work
- Unnamed Item
- A comparative study of lot sizing procedures for multi-stage assembly systems
- Dynamic Version of the Economic Lot Size Model
- The Status of Nonlinear Programming Software
- Technical Note—Generalized Covering Relaxation for 0-1 Programs
- Multiple Finite Production Rate Dynamic Lot Size Inventory Models
- A two product dynamic economic lot size production model with either-or production constraints
- Planning Horizons for the Dynamic Lot Size Model: Zabel vs. Protective Procedures and Computational Results
- The Economic Lot Scheduling Problem (ELSP): Review and Extensions
- A Multi-Product Dynamic Lot-Size Model with Individual and Joint Set-up Costs
- Coordinated replenishments of items under time-varying demand: Dynamic programming formulation
- Note—On the Deterministic Demand Multi-Product Single-Machine Lot Scheduling Problem
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
This page was built for publication: A dynamic production planning and scheduling algorithm for two products processed on one line
