IDEAS home Printed from https://ideas.repec.org/a/eee/proeco/v155y2014icp418-426.html
   My bibliography  Save this article

Lot size optimization in manufacturing systems: The surrogate method

Author

Listed:
  • Adacher, Ludovica
  • Cassandras, Christos G.

Abstract

In this paper we extend a stochastic discrete optimization approach so as to tackle the lot-sizing problem in manufacturing systems. In practice, with the surrogate methodology, the lot sizes are continuously adjusted on-line by the gradient-based approach. The lot sizing determines the number of parts batched together for production. We utilize the queueing approach that evidences the existence of a convex relationship between batch size and waiting time (including processing). Large lot sizes will cause long lead times (the batching effect), as the lot size gets smaller the lead time will decrease but once a minimal lot size is reached a further reduction of the lot size will cause high traffic intensities resulting in longer lead times (the saturation effect). The congestion phenomenon is due to the increased number of setups (and thus total setup time). In this paper, we consider the Surrogate method and the Stochastic comparison algorithm. According to our findings, the Surrogate method finds the optimal solution of the original discrete problem and exhibits a very fast convergence. Some numerical results are reported.

Suggested Citation

  • Adacher, Ludovica & Cassandras, Christos G., 2014. "Lot size optimization in manufacturing systems: The surrogate method," International Journal of Production Economics, Elsevier, vol. 155(C), pages 418-426.
  • Handle: RePEc:eee:proeco:v:155:y:2014:i:c:p:418-426
    DOI: 10.1016/j.ijpe.2013.07.026
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0925527313003411
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.ijpe.2013.07.026?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Hafner, Heinz, 1991. "Lot sizing and throughput times in a job shop," International Journal of Production Economics, Elsevier, vol. 23(1-3), pages 111-116, October.
    2. Vroblefski, Mark & Ramesh, R. & Zionts, Stanley, 2000. "Efficient lot-sizing under a differential transportation cost structure for serially distributed warehouses," European Journal of Operational Research, Elsevier, vol. 127(3), pages 574-593, December.
    3. Jaber, Mohamad Y. & Bonney, Maurice, 2003. "Lot sizing with learning and forgetting in set-ups and in product quality," International Journal of Production Economics, Elsevier, vol. 83(1), pages 95-111, January.
    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. Gaetan Belvaux & Laurence A. Wolsey, 2000. "bc --- prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems," Management Science, INFORMS, vol. 46(5), pages 724-738, May.
    6. Uday S. Karmarkar & Sham Kekre & Sunder Kekre & Susan Freeman, 1985. "Lot-Sizing and Lead-time Performance in a Manufacturing Cell," Interfaces, INFORMS, vol. 15(2), pages 1-9, April.
    7. 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.
    8. Karimi, B. & Fatemi Ghomi, S. M. T. & Wilson, J. M., 2003. "The capacitated lot sizing problem: a review of models and algorithms," Omega, Elsevier, vol. 31(5), pages 365-378, October.
    9. M. Florian & J. K. Lenstra & A. H. G. Rinnooy Kan, 1980. "Deterministic Production Planning: Algorithms and Complexity," Management Science, INFORMS, vol. 26(7), pages 669-679, July.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Chen, Tzu-Li & Cheng, Chen-Yang & Chen, Yin-Yann & Chan, Li-Kai, 2015. "An efficient hybrid algorithm for integrated order batching, sequencing and routing problem," International Journal of Production Economics, Elsevier, vol. 159(C), pages 158-167.
    2. Hanukov, Gabi & Avinadav, Tal & Chernonog, Tatyana & Spiegel, Uriel & Yechiali, Uri, 2018. "Improving efficiency in service systems by performing and storing “preliminary services”," International Journal of Production Economics, Elsevier, vol. 197(C), pages 174-185.
    3. Hanukov, Gabi & Avinadav, Tal & Chernonog, Tatyana & Yechiali, Uri, 2019. "Performance improvement of a service system via stocking perishable preliminary services," European Journal of Operational Research, Elsevier, vol. 274(3), pages 1000-1011.
    4. Hanukov, Gabi & Avinadav, Tal & Chernonog, Tatyana & Yechiali, Uri, 2020. "A service system with perishable products where customers are either fastidious or strategic," International Journal of Production Economics, Elsevier, vol. 228(C).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Leonardo Lozano & J. Cole Smith, 2017. "A Backward Sampling Framework for Interdiction Problems with Fortification," INFORMS Journal on Computing, INFORMS, vol. 29(1), pages 123-139, February.
    2. Helber, Stefan & Sahling, Florian, 2010. "A fix-and-optimize approach for the multi-level capacitated lot sizing problem," International Journal of Production Economics, Elsevier, vol. 123(2), pages 247-256, February.
    3. Andrea Raiconi & Julia Pahl & Monica Gentili & Stefan Voß & Raffaele Cerulli, 2017. "Tactical Production and Lot Size Planning with Lifetime Constraints: A Comparison of Model Formulations," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 34(05), pages 1-24, October.
    4. Fink, Jiří & Hurink, Johann L., 2015. "Minimizing costs is easier than minimizing peaks when supplying the heat demand of a group of houses," European Journal of Operational Research, Elsevier, vol. 242(2), pages 644-650.
    5. Petering, Matthew E.H. & Chen, Xi & Hsieh, Wen-Huan, 2019. "Inventory control with flexible demand: Cyclic case with multiple batch supply and demand processes," International Journal of Production Economics, Elsevier, vol. 212(C), pages 60-77.
    6. Kerem Akartunalı & Ioannis Fragkos & Andrew J. Miller & Tao Wu, 2016. "Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems," INFORMS Journal on Computing, INFORMS, vol. 28(4), pages 766-780, November.
    7. Brahimi, Nadjib & Absi, Nabil & Dauzère-Pérès, Stéphane & Nordli, Atle, 2017. "Single-item dynamic lot-sizing problems: An updated survey," European Journal of Operational Research, Elsevier, vol. 263(3), pages 838-863.
    8. Nadjib Brahimi & Tarik Aouam, 2016. "Multi-item production routing problem with backordering: a MILP approach," International Journal of Production Research, Taylor & Francis Journals, vol. 54(4), pages 1076-1093, February.
    9. Ou, Jinwen, 2017. "Improved exact algorithms to economic lot-sizing with piecewise linear production costs," European Journal of Operational Research, Elsevier, vol. 256(3), pages 777-784.
    10. Tao Wu, 2022. "Predictive Search for Capacitated Multi-Item Lot Sizing Problems," INFORMS Journal on Computing, INFORMS, vol. 34(1), pages 385-406, January.
    11. Ou, Jinwen & Feng, Jiejian, 2019. "Production lot-sizing with dynamic capacity adjustment," European Journal of Operational Research, Elsevier, vol. 272(1), pages 261-269.
    12. Pahl, Julia & Voß, Stefan, 2014. "Integrating deterioration and lifetime constraints in production and supply chain planning: A survey," European Journal of Operational Research, Elsevier, vol. 238(3), pages 654-674.
    13. 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.
    14. Absi, Nabil & Kedad-Sidhoum, Safia, 2008. "The multi-item capacitated lot-sizing problem with setup times and shortage costs," European Journal of Operational Research, Elsevier, vol. 185(3), pages 1351-1374, March.
    15. Wei, Mingyuan & Qi, Mingyao & Wu, Tao & Zhang, Canrong, 2019. "Distance and matching-induced search algorithm for the multi-level lot-sizing problem with substitutable bill of materials," European Journal of Operational Research, Elsevier, vol. 277(2), pages 521-541.
    16. Kerem Akartunalı & Andrew Miller, 2012. "A computational analysis of lower bounds for big bucket production planning problems," Computational Optimization and Applications, Springer, vol. 53(3), pages 729-753, December.
    17. Tao Wu & Leyuan Shi & Joseph Geunes & Kerem Akartunalı, 2012. "On the equivalence of strong formulations for capacitated multi-level lot sizing problems with setup times," Journal of Global Optimization, Springer, vol. 53(4), pages 615-639, August.
    18. Melega, Gislaine Mara & de Araujo, Silvio Alexandre & Jans, Raf, 2018. "Classification and literature review of integrated lot-sizing and cutting stock problems," European Journal of Operational Research, Elsevier, vol. 271(1), pages 1-19.
    19. Awi Federgruen & Joern Meissner & Michal Tzur, 2007. "Progressive Interval Heuristics for Multi-Item Capacitated Lot-Sizing Problems," Operations Research, INFORMS, vol. 55(3), pages 490-502, June.
    20. Akbalik, Ayse & Penz, Bernard, 2009. "Exact methods for single-item capacitated lot sizing problem with alternative machines and piece-wise linear production costs," International Journal of Production Economics, Elsevier, vol. 119(2), pages 367-379, June.

    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:eee:proeco:v:155:y:2014:i:c:p:418-426. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc 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 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/ijpe .

    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.