IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v250y2016i3p773-781.html
   My bibliography  Save this article

The weighted uncapacitated planned maintenance problem: Complexity and polyhedral properties

Author

Listed:
  • Kuschel, Torben
  • Bock, Stefan

Abstract

This paper introduces the Weighted Uncapacitated Planned Maintenance Problem (WUPMP). Based on guaranteed maximum service intervals, the WUPMP pursues the finding of a maintenance schedule that minimizes the resulting total fixed and variable costs. One finding is that significant polyhedral attributes of its solution space are derived. Among them, quasi-integrality that allows for applying an integral simplex algorithm is proven. Moreover, we prove strong NP-hardness and propose an exact solution procedure that is polynomial if the number of considered maintenance activities or the number of periods is constant. Since at least one restriction applies to most real-world applications, the algorithm provides practical decision support. Furthermore, the complexity status of various polynomial special cases of the WUPMP is resolved.

Suggested Citation

  • Kuschel, Torben & Bock, Stefan, 2016. "The weighted uncapacitated planned maintenance problem: Complexity and polyhedral properties," European Journal of Operational Research, Elsevier, vol. 250(3), pages 773-781.
    • Handle: RePEc:eee:ejores:v:250:y:2016:i:3:p:773-781
    DOI: 10.1016/j.ejor.2015.10.038
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221715009649
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2015.10.038?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. Pintelon, L. M. & Gelders, L. F., 1992. "Maintenance management decision making," European Journal of Operational Research, Elsevier, vol. 58(3), pages 301-317, May.
    2. Boysen, Nils & Emde, Simon & Hoeck, Michael & Kauderer, Markus, 2015. "Part logistics in the automotive industry: Decision problems, literature review and research agenda," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 79443, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    3. Boysen, Nils & Emde, Simon & Hoeck, Michael & Kauderer, Markus, 2015. "Part logistics in the automotive industry: Decision problems, literature review and research agenda," European Journal of Operational Research, Elsevier, vol. 242(1), pages 107-120.
    4. Scarf, Philip A., 1997. "On the application of mathematical models in maintenance," European Journal of Operational Research, Elsevier, vol. 99(3), pages 493-506, June.
    5. Chen, Jen-Shiang, 2008. "Scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan," European Journal of Operational Research, Elsevier, vol. 190(1), pages 90-102, October.
    6. Grigoriev, Alexander & van de Klundert, Joris & Spieksma, Frits C.R., 2006. "Modeling and solving the periodic maintenance problem," European Journal of Operational Research, Elsevier, vol. 172(3), pages 783-797, August.
    7. Bock, Stefan, 2015. "Solving the traveling repairman problem on a line with general processing times and deadlines," European Journal of Operational Research, Elsevier, vol. 244(3), pages 690-703.
    8. Harvey M. Wagner & Richard J. Giglio & R. George Glaser, 1964. "Preventive Maintenance Scheduling by Mathematical Programming," Management Science, INFORMS, vol. 10(2), pages 316-334, January.
    9. Abdelouahab Zaghrouti & François Soumis & Issmail El Hallaoui, 2014. "Integral Simplex Using Decomposition for the Set Partitioning Problem," Operations Research, INFORMS, vol. 62(2), pages 435-449, April.
    10. Krarup, Jakob & Pruzan, Peter Mark, 1983. "The simple plant location problem: Survey and synthesis," European Journal of Operational Research, Elsevier, vol. 12(1), pages 36-57, January.
    11. Kaj Holmberg & Johan Hellstrand, 1998. "Solving the Uncapacitated Network Design Problem by a Lagrangean Heuristic and Branch-and-Bound," Operations Research, INFORMS, vol. 46(2), pages 247-259, 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. Kuschel, Torben & Bock, Stefan, 2019. "Solving the Weighted Capacitated Planned Maintenance Problem and its variants," European Journal of Operational Research, Elsevier, vol. 272(3), pages 847-858.

    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. Bock, Stefan, 2020. "Optimally solving a versatile Traveling Salesman Problem on tree networks with soft due dates and multiple congestion scenarios," European Journal of Operational Research, Elsevier, vol. 283(3), pages 863-882.
    2. Stefan Bock, 2016. "Finding optimal tour schedules on transportation paths under extended time window constraints," Journal of Scheduling, Springer, vol. 19(5), pages 527-546, October.
    3. Kuschel, Torben & Bock, Stefan, 2019. "Solving the Weighted Capacitated Planned Maintenance Problem and its variants," European Journal of Operational Research, Elsevier, vol. 272(3), pages 847-858.
    4. Timo Gschwind & Stefan Irnich & Simon Emde & Christian Tilk, 2018. "Branch-Cut-and-Price for the Scheduling Deliveries with Time Windows in a Direct Shipping Network," Working Papers 1805, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    5. Baals, Julian & Emde, Simon & Turkensteen, Marcel, 2023. "Minimizing earliness-tardiness costs in supplier networks—A just-in-time truck routing problem," European Journal of Operational Research, Elsevier, vol. 306(2), pages 707-741.
    6. Meyer, Anne & Amberg, Boris, 2018. "Transport concept selection considering supplier milk runs – An integrated model and a case study from the automotive industry," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 113(C), pages 147-169.
    7. Simon Emde, 2017. "Scheduling the replenishment of just-in-time supermarkets in assembly plants," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 39(1), pages 321-345, January.
    8. Masood Fathi & Victoria Rodríguez & Dalila B.M.M. Fontes & Maria Jesus Alvarez, 2016. "A modified particle swarm optimisation algorithm to solve the part feeding problem at assembly lines," International Journal of Production Research, Taylor & Francis Journals, vol. 54(3), pages 878-893, February.
    9. Jun Wang & Jingbo Yin & Rafi Ullah Khan & Siqi Wang & Tie Zheng, 2021. "A Study of Inbound Logistics Mode Based on JIT Production in Cruise Ship Construction," Sustainability, MDPI, vol. 13(3), pages 1-18, February.
    10. Timo Gschwind & Stefan Irnich & Christian Tilk & Simon Emde, 2020. "Branch-cut-and-price for scheduling deliveries with time windows in a direct shipping network," Journal of Scheduling, Springer, vol. 23(3), pages 363-377, June.
    11. Mustapha Sali & Evren Sahin, 2016. "Line feeding optimization for Just in Time assembly lines: an application to the automotive industry," Post-Print hal-01265041, HAL.
    12. Wenquan Dong & Mingzhou Jin & Yanyan Wang & Peter Kelle, 2021. "Retrieval scheduling in crane-based 3D automated retrieval and storage systems with shuttles," Annals of Operations Research, Springer, vol. 302(1), pages 111-135, July.
    13. Diefenbach, Heiko & Emde, Simon & Glock, Christoph H., 2020. "Loading tow trains ergonomically for just-in-time part supply," European Journal of Operational Research, Elsevier, vol. 284(1), pages 325-344.
    14. Dulebenets, Maxim A., 2019. "A Delayed Start Parallel Evolutionary Algorithm for just-in-time truck scheduling at a cross-docking facility," International Journal of Production Economics, Elsevier, vol. 212(C), pages 236-258.
    15. Quetschlich, Mathias & Moetz, André & Otto, Boris, 2021. "Optimisation model for multi-item multi-echelon supply chains with nested multi-level products," European Journal of Operational Research, Elsevier, vol. 290(1), pages 144-158.
    16. Sali, Mustapha & Sahin, Evren, 2016. "Line feeding optimization for Just in Time assembly lines: An application to the automotive industry," International Journal of Production Economics, Elsevier, vol. 174(C), pages 54-67.
    17. Emde, Simon & Gendreau, Michel, 2017. "Scheduling in-house transport vehicles to feed parts to automotive assembly lines," European Journal of Operational Research, Elsevier, vol. 260(1), pages 255-267.
    18. Lijun Liu & Zhixin Long & Chuangchuang Kou & Haozeng Guo & Xinyu Li, 2023. "Evaluation of the Environmental Cost of Integrated Inbound Logistics: A Case Study of a Gigafactory of a Chinese Logistics Firm," Sustainability, MDPI, vol. 15(15), pages 1-20, July.
    19. Rui Xu & Yumiao Huang & Wei Xiao, 2023. "A Two-Level Variable Neighborhood Descent for a Split Delivery Clustered Vehicle Routing Problem with Soft Cluster Conflicts and Customer-Related Costs," Sustainability, MDPI, vol. 15(9), pages 1-22, May.
    20. Young-Kyou Ha & Su-Han Woo, 2022. "Transportation Infrastructure or Economic Power? Development of the Automobile Industry in the United States," Sustainability, MDPI, vol. 14(3), pages 1-11, January.

    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:ejores:v:250:y:2016:i:3:p:773-781. 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/eor .

    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.