Applying a modified coefficient reduction method to a dynamic production scheduling model
DOI10.1016/0377-2217(92)90297-MzbMath0760.90051MaRDI QIDQ1197923
Monique Guignard, Matthew J. Liberatore
Publication date: 16 January 1993
Published in: European Journal of Operational Research (Search for Journal in Brave)
production schedulingbranch-and-boundpreprocessingcoefficient reductionmulti-product, multi-period environment
Applications of mathematical programming (90C90) Integer programming (90C10) Mixed integer programming (90C11) Production models (90B30) Boolean programming (90C09) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (1)
Cites Work
- Unnamed Item
- A dynamic production planning and scheduling algorithm for two products processed on one line
- A method for reducing coefficients in integer linear inequalities
- The Deterministic Dynamic Product Cycling Problem
- Coefficient reduction for inequalities in 0–1 variables
- Stronger Inequalities for 0, 1 Integer Programming Using Knapsack Functions
This page was built for publication: Applying a modified coefficient reduction method to a dynamic production scheduling model