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

A metaheuristic optimization approach for a real-world stochastic flexible flow shop problem with limited buffer

Author

Listed:
  • Almeder, Christian
  • Hartl, Richard F.

Abstract

This work deals with a scheduling problem of a real-world production process in the metal–working industry. The production process can be described as an offline stochastic flexible flow-shop problem with limited buffers. In a first step, we analyze a simplified model and develop a variable neighborhood search based solution approach where we use multiple scenarios to evaluate the objective. Second, the solution approach is adapted to a real-world case using a detailed discrete-event simulation to evaluate the production plans. We are able to improve state-of-the-art production plans statistically significant by 3–10%.

Suggested Citation

  • Almeder, Christian & Hartl, Richard F., 2013. "A metaheuristic optimization approach for a real-world stochastic flexible flow shop problem with limited buffer," International Journal of Production Economics, Elsevier, vol. 145(1), pages 88-95.
    • Handle: RePEc:eee:proeco:v:145:y:2013:i:1:p:88-95
    DOI: 10.1016/j.ijpe.2012.09.014
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0925527312004100
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ijpe.2012.09.014?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. Gendreau, Michel & Laporte, Gilbert & Seguin, Rene, 1996. "Stochastic vehicle routing," European Journal of Operational Research, Elsevier, vol. 88(1), pages 3-12, January.
    2. Hansen, Pierre & Mladenovic, Nenad & Moreno Pérez, Jos´e A., 2008. "Variable neighborhood search," European Journal of Operational Research, Elsevier, vol. 191(3), pages 593-595, December.
    3. Kis, Tamas & Pesch, Erwin, 2005. "A review of exact solution methods for the non-preemptive multiprocessor flowshop problem," European Journal of Operational Research, Elsevier, vol. 164(3), pages 592-608, August.
    4. Hemmelmayr, Vera C. & Doerner, Karl F. & Hartl, Richard F., 2009. "A variable neighborhood search heuristic for periodic routing problems," European Journal of Operational Research, Elsevier, vol. 195(3), pages 791-802, June.
    5. Russell W. Bent & Pascal Van Hentenryck, 2004. "Scenario-Based Planning for Partially Dynamic Vehicle Routing with Stochastic Customers," Operations Research, INFORMS, vol. 52(6), pages 977-987, December.
    6. Michel Gendreau & Gilbert Laporte & René Séguin, 1996. "A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers," Operations Research, INFORMS, vol. 44(3), pages 469-477, June.
    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. Diaz, Juan Esteban & Handl, Julia & Xu, Dong-Ling, 2018. "Integrating meta-heuristics, simulation and exact techniques for production planning of a failure-prone manufacturing system," European Journal of Operational Research, Elsevier, vol. 266(3), pages 976-989.
    2. Anzhen Peng & Longcheng Liu & Weifeng Lin, 2021. "Improved approximation algorithms for two-stage flexible flow shop scheduling," Journal of Combinatorial Optimization, Springer, vol. 41(1), pages 28-42, January.
    3. Li, Zhan-tao & Chen, Qing-xin & Mao, Ning & Wang, Xiaoming & Liu, Jianjun, 2013. "Scheduling rules for two-stage flexible flow shop scheduling problem subject to tail group constraint," International Journal of Production Economics, Elsevier, vol. 146(2), pages 667-678.
    4. Gerstl, Enrique & Mosheiov, Gur, 2014. "A two-stage flexible flow shop problem with unit-execution-time jobs and batching," International Journal of Production Economics, Elsevier, vol. 158(C), pages 171-178.
    5. Minghui Zhang & Yan Lan & Xin Han, 2020. "Approximation algorithms for two-stage flexible flow shop scheduling," Journal of Combinatorial Optimization, Springer, vol. 39(1), pages 1-14, January.
    6. Juan, Angel A. & Faulin, Javier & Grasman, Scott E. & Rabe, Markus & Figueira, Gonçalo, 2015. "A review of simheuristics: Extending metaheuristics to deal with stochastic combinatorial optimization problems," Operations Research Perspectives, Elsevier, vol. 2(C), pages 62-72.

    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. Lars M. Hvattum & Arne Løkketangen & Gilbert Laporte, 2006. "Solving a Dynamic and Stochastic Vehicle Routing Problem with a Sample Scenario Hedging Heuristic," Transportation Science, INFORMS, vol. 40(4), pages 421-438, November.
    2. Shukla, Nagesh & Choudhary, A.K. & Prakash, P.K.S. & Fernandes, K.J. & Tiwari, M.K., 2013. "Algorithm portfolios for logistics optimization considering stochastic demands and mobility allowance," International Journal of Production Economics, Elsevier, vol. 141(1), pages 146-166.
    3. Briseida Sarasola & Karl Doerner & Verena Schmid & Enrique Alba, 2016. "Variable neighborhood search for the stochastic and dynamic vehicle routing problem," Annals of Operations Research, Springer, vol. 236(2), pages 425-461, January.
    4. Gregorio Tirado & Lars Magnus Hvattum, 2017. "Improved solutions to dynamic and stochastic maritime pick-up and delivery problems using local search," Annals of Operations Research, Springer, vol. 253(2), pages 825-843, June.
    5. Briseida Sarasola & Karl F. Doerner & Verena Schmid & Enrique Alba, 2016. "Variable neighborhood search for the stochastic and dynamic vehicle routing problem," Annals of Operations Research, Springer, vol. 236(2), pages 425-461, January.
    6. Angel Juan & Javier Faulin & Josep Jorba & Jose Caceres & Joan Marquès, 2013. "Using parallel & distributed computing for real-time solving of vehicle routing problems with stochastic demands," Annals of Operations Research, Springer, vol. 207(1), pages 43-65, August.
    7. Goodson, Justin C. & Ohlmann, Jeffrey W. & Thomas, Barrett W., 2012. "Cyclic-order neighborhoods with application to the vehicle routing problem with stochastic demand," European Journal of Operational Research, Elsevier, vol. 217(2), pages 312-323.
    8. Chiang, Wen-Chyuan & Russell, Robert & Xu, Xiaojing & Zepeda, David, 2009. "A simulation/metaheuristic approach to newspaper production and distribution supply chain problems," International Journal of Production Economics, Elsevier, vol. 121(2), pages 752-767, October.
    9. Mathias A. Klapp & Alan L. Erera & Alejandro Toriello, 2018. "The One-Dimensional Dynamic Dispatch Waves Problem," Transportation Science, INFORMS, vol. 52(2), pages 402-415, March.
    10. Jinil Han & Chungmok Lee & Sungsoo Park, 2014. "A Robust Scenario Approach for the Vehicle Routing Problem with Uncertain Travel Times," Transportation Science, INFORMS, vol. 48(3), pages 373-390, August.
    11. Bhoopalam, Anirudh Kishore & Agatz, Niels & Zuidwijk, Rob, 2018. "Planning of truck platoons: A literature review and directions for future research," Transportation Research Part B: Methodological, Elsevier, vol. 107(C), pages 212-228.
    12. Felipe, Angel & Teresa Ortuño, M. & Tirado, Gregorio, 2011. "Using intermediate infeasible solutions to approach vehicle routing problems with precedence and loading constraints," European Journal of Operational Research, Elsevier, vol. 211(1), pages 66-75, May.
    13. Albareda-Sambola, Maria & Fernandez, Elena & Laporte, Gilbert, 2007. "Heuristic and lower bound for a stochastic location-routing problem," European Journal of Operational Research, Elsevier, vol. 179(3), pages 940-955, June.
    14. Prasanna Balaprakash & Mauro Birattari & Thomas Stützle & Marco Dorigo, 2015. "Estimation-based metaheuristics for the single vehicle routing problem with stochastic demands and customers," Computational Optimization and Applications, Springer, vol. 61(2), pages 463-487, June.
    15. Van Woensel, T. & Kerbache, L. & Peremans, H. & Vandaele, N., 2008. "Vehicle routing with dynamic travel times: A queueing approach," European Journal of Operational Research, Elsevier, vol. 186(3), pages 990-1007, May.
    16. Majid Salavati-Khoshghalb & Michel Gendreau & Ola Jabali & Walter Rei, 2019. "A hybrid recourse policy for the vehicle routing problem with stochastic demands," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 8(3), pages 269-298, September.
    17. Yao, Yu & Zhu, Xiaoning & Dong, Hongyu & Wu, Shengnan & Wu, Hailong & Carol Tong, Lu & Zhou, Xuesong, 2019. "ADMM-based problem decomposition scheme for vehicle routing problem with time windows," Transportation Research Part B: Methodological, Elsevier, vol. 129(C), pages 156-174.
    18. Soumia Ichoua & Michel Gendreau & Jean-Yves Potvin, 2006. "Exploiting Knowledge About Future Demands for Real-Time Vehicle Dispatching," Transportation Science, INFORMS, vol. 40(2), pages 211-225, May.
    19. Wang, Zhongxiang & Haghani, Ali, 2020. "Column generation-based stochastic school bell time and bus scheduling optimization," European Journal of Operational Research, Elsevier, vol. 286(3), pages 1087-1102.
    20. Manousakis, Eleftherios G. & Kasapidis, Grigoris A. & Kiranoudis, Chris T. & Zachariadis, Emmanouil E., 2022. "An infeasible space exploring matheuristic for the Production Routing Problem," European Journal of Operational Research, Elsevier, vol. 298(2), pages 478-495.

    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:145:y:2013:i:1:p:88-95. 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.