We introduce a heuristic method for finding good feasible solutions for multi-product lot sizing problems with general assembly structures, multiple constrained resources, and non-zero 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% worse than optimal in less than 1% of time required by OSL. The heuristic solutions to medium-sized problems are approximately 26% better than solutions OSL finds after 10,000 CPU seconds, and the heuristic finds these solutions in approximately 10% of OSL's time.
Download Info
To our knowledge, this item is not available for
download. To find whether it is available, there are three
options:
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page
whether it is in fact available.
3. Perform a search for a similarly titled item that would be
available.
Publisher Info
Paper provided by University of Bonn, Germany in its series Discussion Paper Serie B with number
346.
Length: pages Date of creation: Jun 1995 Date of revision: Handle: RePEc:bon:bonsfb:346
Contact details of provider: Postal: Bonn Graduate School of Economics, University of Bonn, Adenauerallee 24 - 26, 53113 Bonn, Germany Fax: +49 228 73 9221 Web page: http://www.bgse.uni-bonn.de/index.php?id=517
For technical questions regarding this item, or to correct its listing, contact: (Daniel Park).
Cited by: (explanations, Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.)