scientific article; zbMATH DE number 822146

MaRDI QIDQ4856281zbMATH OpenFDO

Authors Lei Zhang, Xiaoguang Yang, Bao-guang Xu

Publication date 29 November 1995

zbMATH Keywords

optimal lot-sizepolynomial time algorithmproduction planning

Mathematics Subject Classification ID

Production models (90B30) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• A polynomial algorithm for a multi-item capacitated production planning problem
• An optimal algorithm for the multi-item capacitated production planning problem
• On production smoothing
• A single-product parallel-facilities production-planning model
• Extensions of the Planning Horizon Theorem in the Dynamic Lot Size Model

Cited in

(5)

• A polynomial algorithm for a multi-item capacitated production planning problem
• On the polyhedral structure of a multi-item production planning model with setup times
• scientific article; zbMATH DE number 3874947 (Why is no real title available?)
• scientific article; zbMATH DE number 1179853 (Why is no real title available?)
• scientific article; zbMATH DE number 1757964 (Why is no real title available?)

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 Q4856281)