Final Remarks and Future Perspectives

Torben Kuschel
Additional contact information
Torben Kuschel: University of Wuppertal

Chapter Chapter 8 in Capacitated Planned Maintenance, 2017, pp 267-271 from Springer

Abstract: Abstract This chapter summarizes the presented work for Capacitated Planned Maintenance Problem (CPMP) and the Weighted Uncapacitated Planned Maintenance Problem (WUPMP) that are both strongly $$\mathcal{N}\mathcal{P}$$ -hard. The main computational complexity results and the running time of optimal algorithms are given. The WUPMP has the single-assignment property and the polytope is quasi-integral. A generalized period covering constraint has an integral polytope. The CPMP is solved via construction heuristics, Lagrangean heuristics, a novel Lagrangean hybrid approach that links two Lagrangean relaxations and tabu search. The performance of these approaches is described. It is advantageous to derive valid subgradients from heuristically derived feasible solutions, whereas many approaches in literature solve the Lagrangean relaxation to optimality.

Date: 2017
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:lnechp:978-3-319-40289-5_8

Ordering information: This item can be ordered from
http://www.springer.com/9783319402895

DOI: 10.1007/978-3-319-40289-5_8

Access Statistics for this chapter

More chapters in Lecture Notes in Economics and Mathematical Systems from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().