Lot Sizing in General Assembly Systems with Setup Costs, Setup Times, and Multiple Constrained Resources

Authors:
Elena Katok;Holly S. Lewis;Terry P. Harrison
Affiliations:
-;-;-
Venue:
Management Science
Year:
1998

Citing 0
Cited 7

Scheduling injection molding operations with multiple resource constraints and sequence dependent setup times and costs

Computers and Operations Research
A cross entropy-Lagrangean hybrid algorithm for the multi-item capacitated lot-sizing problem with setup times

Computers and Operations Research
Solving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix-and-optimize heuristic

Computers and Operations Research
Combination of genetic algorithm with Lagrange multipliers for lot-size determination in multi-stage production scheduling problems

Expert Systems with Applications: An International Journal
A 0--1 LP Model for the Integration and Consolidation of Air Cargo Shipments

Operations Research
MIP formulations and heuristics for two-level production-transportation problems

Computers and Operations Research
A computational analysis of lower bounds for big bucket production planning problems

Computational Optimization and Applications

Quantified Score

Hi-index	0.01

Visualization

Abstract

We introduce a heuristic method for finding good, feasible solutions for multiproduct lot sizing problems with general assembly structures, multiple constrained resources, and nonzero setup costs and setup times. We evaluate the performance of this heuristic by comparing its solutions to optimal solutions of small randomly generated problems and to time-truncated Optimization Subroutine Library (OSL) solutions of medium-sized randomly generated problems. In the first case, the heuristic locates solutions averaging 4 percent worse than optimal in less than 1 percent of time required by OSL. The heuristic solutions to medium-sized problems are approximately 26 percent better than solutions OSL finds after 10,000 CPU seconds, and the heuristic finds these solutions in approximately 10 percent of OSL time.