IDEAS home Printed from https://ideas.repec.org/a/wsi/apjorx/v34y2017i02ns0217595917500038.html
   My bibliography  Save this article

Simulation Optimization for MRO Systems Operations

Author

Listed:
  • Pai Liu

    (Department of Industrial Engineering & Management, Peking University, Beijing 100871, P. R. China)

  • Xi Zhang

    (Department of Industrial Engineering & Management, Peking University, Beijing 100871, P. R. China)

  • Zhongshun Shi

    (Department of Industrial Engineering & Management, Peking University, Beijing 100871, P. R. China)

  • Zewen Huang

    (Department of Industrial Engineering & Management, Peking University, Beijing 100871, P. R. China)

Abstract

In this paper, we address the scheduling issues in a class of maintenance, repair and overhaul systems. By considering all key characteristics such as disassembly, material recovery uncertainty, material matching requirements, stochastic routings and variable processing times, the scheduling problem is formulated into a simulation optimization problem. To solve this difficult problem, we developed two hybrid algorithms based on nested partitions method and optimal computing budged allocation technology. Asymptotic convergence of these two algorithms is proved and numerical results show that the proposed algorithms can generate high quality solutions which outperform the performance of many heuristics.

Suggested Citation

  • Pai Liu & Xi Zhang & Zhongshun Shi & Zewen Huang, 2017. "Simulation Optimization for MRO Systems Operations," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 34(02), pages 1-23, April.
    • Handle: RePEc:wsi:apjorx:v:34:y:2017:i:02:n:s0217595917500038
    DOI: 10.1142/S0217595917500038
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0217595917500038
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0217595917500038?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. Jie Xu & Si Zhang & Edward Huang & Chun-Hung Chen & Loo Hay Lee & Nurcin Celik, 2016. "MO2TOS: Multi-Fidelity Optimization with Ordinal Transformation and Optimal Sampling," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 33(03), pages 1-26, June.
    2. Reményi, Christoph & Staudacher, Stephan, 2014. "Systematic simulation based approach for the identification and implementation of a scheduling rule in the aircraft engine maintenance," International Journal of Production Economics, Elsevier, vol. 147(PA), pages 94-107.
    3. Min-Geun Kim & Jae-Min Yu & Dong-Ho Lee, 2015. "Scheduling algorithms for remanufacturing systems with parallel flow-shop-type reprocessing lines," International Journal of Production Research, Taylor & Francis Journals, vol. 53(6), pages 1819-1831, March.
    4. Jie Xu & Edward Huang & Chun-Hung Chen & Loo Hay Lee, 2015. "Simulation Optimization: A Review and Exploration in the New Era of Cloud Computing and Big Data," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 32(03), pages 1-34.
    5. Nawaz, Muhammad & Enscore Jr, E Emory & Ham, Inyong, 1983. "A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem," Omega, Elsevier, vol. 11(1), pages 91-95.
    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. Lingxuan Liu & Leyuan Shi, 2019. "Simulation Optimization on Complex Job Shop Scheduling with Non-Identical Job Sizes," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 36(05), pages 1-26, October.

    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. Jianpei Wen & Hanyu Jiang & Jie Song, 2019. "A Stochastic Queueing Model for Capacity Allocation in the Hierarchical Healthcare Delivery System," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 36(01), pages 1-24, February.
    2. Lingxuan Liu & Leyuan Shi, 2019. "Simulation Optimization on Complex Job Shop Scheduling with Non-Identical Job Sizes," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 36(05), pages 1-26, October.
    3. Li, Na & Zhang, Yue & Teng, De & Kong, Nan, 2021. "Pareto optimization for control agreement in patient referral coordination," Omega, Elsevier, vol. 101(C).
    4. Wai Kin Victor Chan, 2016. "Linear Programming Formulation of Idle Times for Single-Server Discrete-Event Simulation Models," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 33(05), pages 1-17, October.
    5. Giulia Pedrielli & K. Selcuk Candan & Xilun Chen & Logan Mathesen & Alireza Inanalouganji & Jie Xu & Chun-Hung Chen & Loo Hay Lee, 2019. "Generalized Ordinal Learning Framework (GOLF) for Decision Making with Future Simulated Data," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 36(06), pages 1-35, December.
    6. Yu Zhao & Xi Zhang & Zhongshun Shi & Lei He, 2017. "Grain Price Forecasting Using a Hybrid Stochastic Method," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 34(05), pages 1-24, October.
    7. Robert Cuckler & Kuo-Hao Chang & Liam Y. Hsieh, 2017. "Optimal Parallel Machine Allocation Problem in IC Packaging Using IC-PSO: An Empirical Study," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 34(06), pages 1-20, December.
    8. Andrzej Kozik, 2017. "Handling precedence constraints in scheduling problems by the sequence pair representation," Journal of Combinatorial Optimization, Springer, vol. 33(2), pages 445-472, February.
    9. Hongyu He & Yanzhi Zhao & Xiaojun Ma & Zheng-Guo Lv & Ji-Bo Wang, 2023. "Branch-and-Bound and Heuristic Algorithms for Group Scheduling with Due-Date Assignment and Resource Allocation," Mathematics, MDPI, vol. 11(23), pages 1-14, November.
    10. Sündüz Dağ, 2013. "An Application On Flowshop Scheduling," Alphanumeric Journal, Bahadir Fatih Yildirim, vol. 1(1), pages 47-56, December.
    11. Chen, Chuen-Lung & Vempati, Venkateswara S. & Aljaber, Nasser, 1995. "An application of genetic algorithms for flow shop problems," European Journal of Operational Research, Elsevier, vol. 80(2), pages 389-396, January.
    12. Solimanpur, M. & Vrat, Prem & Shankar, Ravi, 2004. "A heuristic to minimize makespan of cell scheduling problem," International Journal of Production Economics, Elsevier, vol. 88(3), pages 231-241, April.
    13. Barry B. & Quim Castellà & Angel A. & Helena Ramalhinho Lourenco & Manuel Mateo, 2012. "ILS-ESP: An Efficient, Simple, and Parameter-Free Algorithm for Solving the Permutation Flow-Shop Problem," Working Papers 636, Barcelona School of Economics.
    14. Gupta, Jatinder N.D. & Koulamas, Christos & Kyparisis, George J., 2006. "Performance guarantees for flowshop heuristics to minimize makespan," European Journal of Operational Research, Elsevier, vol. 169(3), pages 865-872, March.
    15. Shuang Xiao & Guo Li & Yunjing Jia, 2017. "Estimating the Constant Elasticity of Variance Model with Data-Driven Markov Chain Monte Carlo Methods," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 34(01), pages 1-23, February.
    16. Yu-Jun Zheng & Yi-Chen Du & Wei-Guo Sheng & Hai-Feng Ling, 2019. "Collaborative Human–UAV Search and Rescue for Missing Tourists in Nature Reserves," Interfaces, INFORMS, vol. 49(5), pages 371-383, September.
    17. Brammer, Janis & Lutz, Bernhard & Neumann, Dirk, 2022. "Permutation flow shop scheduling with multiple lines and demand plans using reinforcement learning," European Journal of Operational Research, Elsevier, vol. 299(1), pages 75-86.
    18. Quang Chieu Ta & Jean-Charles Billaut & Jean-Louis Bouquard, 2018. "Matheuristic algorithms for minimizing total tardiness in the m-machine flow-shop scheduling problem," Journal of Intelligent Manufacturing, Springer, vol. 29(3), pages 617-628, March.
    19. Tseng, Lin-Yu & Lin, Ya-Tai, 2009. "A hybrid genetic local search algorithm for the permutation flowshop scheduling problem," European Journal of Operational Research, Elsevier, vol. 198(1), pages 84-92, October.
    20. Gerardo Minella & Rubén Ruiz & Michele Ciavotta, 2008. "A Review and Evaluation of Multiobjective Algorithms for the Flowshop Scheduling Problem," INFORMS Journal on Computing, INFORMS, vol. 20(3), pages 451-471, August.

    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:wsi:apjorx:v:34:y:2017:i:02:n:s0217595917500038. 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/apjor/apjor.shtml .

    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.