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

Simulation optimization for the stochastic economic lot scheduling problem with sequence-dependent setup times

Author

Listed:
  • Löhndorf, Nils
  • Riel, Manuel
  • Minner, Stefan

Abstract

We consider the stochastic economic lot scheduling problem (SELSP) with lost sales and random demand where switching between products is subject to sequence-dependent setup times. We propose a solution based on simulation optimization using an iterative two-step procedure which combines global policy search with local search heuristics for the traveling salesman sequencing subproblem. To optimize the production cycle, we compare two criteria: minimizing total setup times and evenly distributing setups to obtain a more regular production cycle. Based on a numerical study, we find that a policy with a balanced production cycle leads to lower cost than other policies with unbalanced cycles.

Suggested Citation

  • Löhndorf, Nils & Riel, Manuel & Minner, Stefan, 2014. "Simulation optimization for the stochastic economic lot scheduling problem with sequence-dependent setup times," International Journal of Production Economics, Elsevier, vol. 157(C), pages 170-176.
    • Handle: RePEc:eee:proeco:v:157:y:2014:i:c:p:170-176
    DOI: 10.1016/j.ijpe.2014.05.006
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0925527314001625
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ijpe.2014.05.006?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. Serge M. Karalli & A. Dale Flowers, 2006. "The Multiple-Family ELSP with Safety Stocks," Operations Research, INFORMS, vol. 54(3), pages 523-531, June.
    2. Helber, Stefan & Sahling, Florian & Schimmelpfeng, Katja, 2011. "Dynamic capacitated lot sizing with random demand and dynamic safety stocks," Hannover Economic Papers (HEP) dp-465, Leibniz Universität Hannover, Wirtschaftswissenschaftliche Fakultät.
    3. Nils Löhndorf & Stefan Minner, 2013. "Simulation optimization for the stochastic economic lot scheduling problem," IISE Transactions, Taylor & Francis Journals, vol. 45(7), pages 796-810.
    4. Wagner, Michael & Smits, Sanne R., 2004. "A local search algorithm for the optimization of the stochastic economic lot scheduling problem," International Journal of Production Economics, Elsevier, vol. 90(3), pages 391-402, August.
    5. Gregory Dobson, 1992. "The Cyclic Lot Scheduling Problem with Sequence-Dependent Setups," Operations Research, INFORMS, vol. 40(4), pages 736-749, August.
    6. Awi Federgruen & Ziv Katalan, 1998. "Determining Production Schedules Under Base-Stock Policies in Single Facility Multi-Item Production Systems," Operations Research, INFORMS, vol. 46(6), pages 883-898, December.
    7. Sox, Charles R. & Jackson, Peter L. & Bowman, Alan & Muckstadt, John A., 1999. "A review of the stochastic lot scheduling problem," International Journal of Production Economics, Elsevier, vol. 62(3), pages 181-200, September.
    8. Allahverdi, Ali & Gupta, Jatinder N. D. & Aldowaisan, Tariq, 1999. "A review of scheduling research involving setup considerations," Omega, Elsevier, vol. 27(2), pages 219-239, April.
    9. Allahverdi, Ali & Ng, C.T. & Cheng, T.C.E. & Kovalyov, Mikhail Y., 2008. "A survey of scheduling problems with setup times or costs," European Journal of Operational Research, Elsevier, vol. 187(3), pages 985-1032, June.
    10. Helsgaun, Keld, 2000. "An effective implementation of the Lin-Kernighan traveling salesman heuristic," European Journal of Operational Research, Elsevier, vol. 126(1), pages 106-130, October.
    11. George Liberopoulos & Dimitrios Pandelis & Olympia Hatzikonstantinou, 2013. "The stochastic economic lot sizing problem for non-stop multi-grade production with sequence-restricted setup changeovers," Annals of Operations Research, Springer, vol. 209(1), pages 179-205, October.
    12. Winands, E.M.M. & Adan, I.J.B.F. & van Houtum, G.J., 2011. "The stochastic economic lot scheduling problem: A survey," European Journal of Operational Research, Elsevier, vol. 210(1), pages 1-9, April.
    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. Jana, R.K. & Mitra, Subrata K. & Sharma, Dinesh K., 2018. "Software vendors travel management decisions using an elitist nonhomogeneous genetic algorithm," International Journal of Production Economics, Elsevier, vol. 202(C), pages 123-131.
    2. Liou, Cheng-Dar & Hsieh, Yi-Chih, 2015. "A hybrid algorithm for the multi-stage flow shop group scheduling with sequence-dependent setup and transportation times," International Journal of Production Economics, Elsevier, vol. 170(PA), pages 258-267.
    3. Menezes, Mozart B.C. & Jalali, Hamed & Lamas, Alejandro, 2021. "One too many: Product proliferation and the financial performance in manufacturing," International Journal of Production Economics, Elsevier, vol. 242(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. George Liberopoulos & Dimitrios Pandelis & Olympia Hatzikonstantinou, 2013. "The stochastic economic lot sizing problem for non-stop multi-grade production with sequence-restricted setup changeovers," Annals of Operations Research, Springer, vol. 209(1), pages 179-205, October.
    2. Jodlbauer, Herbert & Reitner, Sonja, 2012. "Optimizing service-level and relevant cost for a stochastic multi-item cyclic production system," International Journal of Production Economics, Elsevier, vol. 136(2), pages 306-317.
    3. Briskorn, Dirk & Zeise, Philipp & Packowski, Josef, 2016. "Quasi-fixed cyclic production schemes for multiple products with stochastic demand," European Journal of Operational Research, Elsevier, vol. 252(1), pages 156-169.
    4. Winands, E.M.M. & Adan, I.J.B.F. & van Houtum, G.J., 2011. "The stochastic economic lot scheduling problem: A survey," European Journal of Operational Research, Elsevier, vol. 210(1), pages 1-9, April.
    5. Marko Ɖurasević & Domagoj Jakobović, 2019. "Creating dispatching rules by simple ensemble combination," Journal of Heuristics, Springer, vol. 25(6), pages 959-1013, December.
    6. Byung-Cheon Choi & Myoung-Ju Park, 2015. "A Batch Scheduling Problem with Two Agents," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 32(06), pages 1-19, December.
    7. Beck, Fabian G. & Biel, Konstantin & Glock, Christoph H., 2019. "Integration of energy aspects into the economic lot scheduling problem," International Journal of Production Economics, Elsevier, vol. 209(C), pages 399-410.
    8. Og[breve]uz, Ceyda & Sibel Salman, F. & Bilgintürk YalçIn, Zehra, 2010. "Order acceptance and scheduling decisions in make-to-order systems," International Journal of Production Economics, Elsevier, vol. 125(1), pages 200-211, May.
    9. Hinder, Oliver & Mason, Andrew J., 2017. "A novel integer programing formulation for scheduling with family setup times on a single machine to minimize maximum lateness," European Journal of Operational Research, Elsevier, vol. 262(2), pages 411-423.
    10. Dirk Briskorn & Konrad Stephan & Nils Boysen, 2022. "Minimizing the makespan on a single machine subject to modular setups," Journal of Scheduling, Springer, vol. 25(1), pages 125-137, February.
    11. Rauchecker, Gerhard & Schryen, Guido, 2019. "An exact branch-and-price algorithm for scheduling rescue units during disaster response," European Journal of Operational Research, Elsevier, vol. 272(1), pages 352-363.
    12. Grundel, Soesja & Çiftçi, Barış & Borm, Peter & Hamers, Herbert, 2013. "Family sequencing and cooperation," European Journal of Operational Research, Elsevier, vol. 226(3), pages 414-424.
    13. Mohammad Reza Hosseinzadeh & Mehdi Heydari & Mohammad Mahdavi Mazdeh, 2022. "Mathematical modeling and two metaheuristic algorithms for integrated process planning and group scheduling with sequence-dependent setup time," Operational Research, Springer, vol. 22(5), pages 5055-5105, November.
    14. Fátima Pilar & Eliana Costa e Silva & Ana Borges, 2023. "Optimizing Vehicle Repairs Scheduling Using Mixed Integer Linear Programming: A Case Study in the Portuguese Automobile Sector," Mathematics, MDPI, vol. 11(11), pages 1-23, June.
    15. Mujawar, Sachin & Huang, Simin & Nagi, Rakesh, 2012. "Scheduling to minimize stringer utilization for continuous annealing operations," Omega, Elsevier, vol. 40(4), pages 437-444.
    16. Sheikh, Shaya & Komaki, G.M. & Kayvanfar, Vahid & Teymourian, Ehsan, 2019. "Multi-Stage assembly flow shop with setup time and release time," Operations Research Perspectives, Elsevier, vol. 6(C).
    17. Beemsterboer, Bart & Land, Martin & Teunter, Ruud, 2016. "Hybrid MTO-MTS production planning: An explorative study," European Journal of Operational Research, Elsevier, vol. 248(2), pages 453-461.
    18. Kampf, M. & Kochel, P., 2006. "Simulation-based sequencing and lot size optimisation for a production-and-inventory system with multiple items," International Journal of Production Economics, Elsevier, vol. 104(1), pages 191-200, November.
    19. Allahverdi, Ali & Aydilek, Harun, 2014. "Total completion time with makespan constraint in no-wait flowshops with setup times," European Journal of Operational Research, Elsevier, vol. 238(3), pages 724-734.
    20. Soares, Leonardo Cabral R. & Carvalho, Marco Antonio M., 2020. "Biased random-key genetic algorithm for scheduling identical parallel machines with tooling constraints," European Journal of Operational Research, Elsevier, vol. 285(3), pages 955-964.

    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:157:y:2014:i:c:p:170-176. 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.