Answers are grounded in this paper and cite their sources.
This paper proposes a heuristic procedure to solve cyclical scheduling problems. Lot sizes for two or more items must be chosen simultaneously for several periods into the future, while recognizing capacity constraints at several work centres. Solving this problem is important in its own right. It also has transfer value to even more complicated situations, such as when the items have parent-component relationships. The proposed heuristic, though in the spirit of Mamie's formulation, has fewer production sequences for each item. The simplified formulation can be solved with a general linear programming code. Another advantage is its use of fixed ordering intervals, which seems to be preferred in practice. Experimental results suggest that the heuristic gives near optimal solutions and requires less computational time. Of particular interest is the heuristic's ability to satisfy capacity constraints when selecting item lot sizes.
No takes yet. Share an insight, caveat, or question.
BAHL et al. (1984) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: