Advanced Search
MyIDEAS: Login to save this paper or follow this series

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

Contents:

Author Info

  • Katok, Elena
  • Holly S. Lewis
  • Terry P. Harrison

Abstract

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.

Bibliographic Info

Paper provided by University of Bonn, Germany in its series Discussion Paper Serie B with number 346.

as in new window
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 6884
Web page: http://www.bgse.uni-bonn.de

Related research

Keywords: Lot sizing; general assembly system; heuristics; integer programming applications;

Other versions of this item:

References

No references listed on IDEAS
You can help add them by filling out this form.

Citations

Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as in new window

Cited by:
  1. Brahimi, Nadjib & Dauzere-Peres, Stephane & Najid, Najib M. & Nordli, Atle, 2006. "Single item lot sizing problems," European Journal of Operational Research, Elsevier, vol. 168(1), pages 1-16, January.
  2. Berretta, Regina & Rodrigues, Luiz Fernando, 2004. "A memetic algorithm for a multistage capacitated lot-sizing problem," International Journal of Production Economics, Elsevier, vol. 87(1), pages 67-81, January.
  3. BELVAUX, Gaetan & WOLSEY, Laurence A., 1998. "Lot-sizing problems: modelling issues and a specialized branch-and-cut system BC-PROD," CORE Discussion Papers 1998049, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
  4. AkartunalI, Kerem & Miller, Andrew J., 2009. "A heuristic approach for big bucket multi-level production planning problems," European Journal of Operational Research, Elsevier, vol. 193(2), pages 396-411, March.
  5. Helber, Stefan & Sahling, Florian, 2008. "A Fix-and-Optimize Approach for the Multi-Level Capacitated Lot Sizing Problems," Hannover Economic Papers (HEP) dp-393, Leibniz Universität Hannover, Wirtschaftswissenschaftliche Fakultät.
  6. Sarker, Bhaba R. & Diponegoro, Ahmad, 2009. "Optimal production plans and shipment schedules in a supply-chain system with multiple suppliers and multiple buyers," European Journal of Operational Research, Elsevier, vol. 194(3), pages 753-773, May.
  7. Süral, Haldun & Denizel, Meltem & Van Wassenhove, Luk N., 2009. "Lagrangean relaxation based heuristics for lot sizing with setup times," European Journal of Operational Research, Elsevier, vol. 194(1), pages 51-63, April.
  8. Jans, Raf & Degraeve, Zeger, 2007. "Meta-heuristics for dynamic lot sizing: A review and comparison of solution approaches," European Journal of Operational Research, Elsevier, vol. 177(3), pages 1855-1875, March.
  9. VAN VYVE, Mathieu & POCHET, Yves, 2001. "A general heuristic or production planning problems," CORE Discussion Papers 2001056, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
  10. Sahling, Florian & Buschkühl, Lisbeth & Tempelmeier, Horst & Helber, Stefan, 2008. "Solving a Multi-Level Capacitated Lot Sizing Problem with Multi-Period Setup Carry-Over via a Fix-and-Optimize Heuristic," Hannover Economic Papers (HEP) dp-400, Leibniz Universität Hannover, Wirtschaftswissenschaftliche Fakultät.

Lists

This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

Statistics

Access and download statistics

Corrections

When requesting a correction, please mention this item's handle: RePEc:bon:bonsfb:346. See general information about how to correct material in RePEc.

For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (BGSE Office).

If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

If references are entirely missing, you can add them using this form.

If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

Please note that corrections may take a couple of weeks to filter through the various RePEc services.