.png){kind=icon}
Return
EFFICIENT POST-OPTIMIZATION ANALYSIS PROCEDURE FOR THE DYNAMIC LOT-SIZING PROBLEM
.png){kind=icon}
PRE
AI
DOI：10.1016/0377-2217(93)90081-W.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we develop an efficient post-optimization analysis procedure for the Wagner-Whitin solution to the Dynamic Lot-Sizing Problem (DLSP). The proposed procedure can be used in the context of a branch-and-bound algorithm, or in smoothing heuristic approaches for solving the Capacitated Lot-Sizing Problem (CLSP).
Keywords:
INVENTORY
PRODUCTION PLANNING
DYNAMIC PROGRAMMING
LOT-SIZING
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSaveShareSave
ShareSave no more
no more