IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v36y1990i3p348-358.html
   My bibliography  Save this article

Economic Lot Scheduling for Multiple Products on Parallel Identical Processors

Author

Listed:
  • Jose Juan Carreno

    (Dpto. de Ingenieria Industrial Tecnologico de Celaya, Mexico)

Abstract

This paper deals with an identical multiprocessor, multiproduct, lot-size scheduling problem under deterministic conditions. The problem is an extension of the single-processor ELSP problem. The objective is to minimize the average production and inventory costs per unit time subject to constraints of no shortages and no interference among the products. A mathematical formulation for the problem is given. A heuristic procedure, which extends the Common Cycle approach for a single processor, is suggested and computational results are reported. Upper and Lower bounds are developed and used to measure the effectiveness of the procedure.

Suggested Citation

  • Jose Juan Carreno, 1990. "Economic Lot Scheduling for Multiple Products on Parallel Identical Processors," Management Science, INFORMS, vol. 36(3), pages 348-358, March.
    • Handle: RePEc:inm:ormnsc:v:36:y:1990:i:3:p:348-358
    DOI: 10.1287/mnsc.36.3.348
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.36.3.348
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.36.3.348?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

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


    Cited by:

    1. Drexl, Andreas & Kimms, Alf, 1996. "Lot sizing and scheduling: Survey and extensions," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 421, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    2. Drexl, A. & Kimms, A., 1997. "Lot sizing and scheduling -- Survey and extensions," European Journal of Operational Research, Elsevier, vol. 99(2), pages 221-235, June.
    3. Goncalves, JoseF. & Leachman, Robert C., 1998. "A hybrid heuristic and linear programming approach to multi-product machine scheduling," European Journal of Operational Research, Elsevier, vol. 110(3), pages 548-563, November.
    4. Nazrul Shaikh & Vittal Prabhu & Danilo Abril & David Sánchez & Jorge Arias & Esteban Rodríguez & Germán Riaño, 2011. "Kimberly-Clark Latin America Builds an Optimization-Based System for Machine Scheduling," Interfaces, INFORMS, vol. 41(5), pages 455-465, October.
    5. Ramesh Bollapragada & Uday Rao, 1999. "Single-Stage Resource Allocation and Economic Lot Scheduling on Multiple, Nonidentical Production Lines," Management Science, INFORMS, vol. 45(6), pages 889-904, June.
    6. Drexl, Andreas & Haase, Knut, 1995. "Proportional lotsizing and scheduling," International Journal of Production Economics, Elsevier, vol. 40(1), pages 73-87, June.
    7. Toledo, Franklina Maria Bragion & Armentano, Vinicius Amaral, 2006. "A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines," European Journal of Operational Research, Elsevier, vol. 175(2), pages 1070-1083, December.
    8. Drexl, Andreas & Haase, Knut, 1992. "A new type of model for multi-item capacitated dynamic lotsizing and scheduling," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 286, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    9. Drexl, Andreas & Haase, Knut, 1993. "Sequential-analysis-based randomized-regret-methods for lotsizing and scheduling," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 323, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    10. Fiorotto, Diego Jacinto & Jans, Raf & Alexandre de Araujo, Silvio, 2018. "Process flexibility and the chaining principle in lot sizing problems," International Journal of Production Economics, Elsevier, vol. 204(C), pages 244-263.
    11. Pesenti, Raffaele & Ukovich, Walter, 2003. "Economic lot scheduling on multiple production lines with resource constraints," International Journal of Production Economics, Elsevier, vol. 81(1), pages 469-481, January.
    12. Bollapragada, Ramesh & Croce, Federico Della & Ghirardi, Marco, 2011. "Discrete-time, economic lot scheduling problem on multiple, non-identical production lines," European Journal of Operational Research, Elsevier, vol. 215(1), pages 89-96, November.
    13. Nascimento, Mariá C.V. & Resende, Mauricio G.C. & Toledo, Franklina M.B., 2010. "GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem," European Journal of Operational Research, Elsevier, vol. 200(3), pages 747-754, February.
    14. Diego Fiorotto & Silvio Araujo, 2014. "Reformulation and a Lagrangian heuristic for lot sizing problem on parallel machines," Annals of Operations Research, Springer, vol. 217(1), pages 213-231, June.
    15. Torabi, S.A. & Karimi, B. & Fatemi Ghomi, S.M.T., 2005. "The common cycle economic lot scheduling in flexible job shops: The finite horizon case," International Journal of Production Economics, Elsevier, vol. 97(1), pages 52-65, July.
    16. Wang, Haibo & Alidaee, Bahram, 2019. "Effective heuristic for large-scale unrelated parallel machines scheduling problems," Omega, Elsevier, vol. 83(C), pages 261-274.
    17. Tao Wu & Zhe Liang & Canrong Zhang, 2018. "Analytics Branching and Selection for the Capacitated Multi-Item Lot Sizing Problem with Nonidentical Machines," INFORMS Journal on Computing, INFORMS, vol. 30(2), pages 236-258, May.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:36:y:1990:i:3:p:348-358. See general information about how to correct material in RePEc.

    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.

    We have no bibliographic references for this item. You can help adding them by using 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 RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

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

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.