| |
|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNINA9910150457603321 |
|
|
Autore |
Kuschel Torben |
|
|
Titolo |
Capacitated Planned Maintenance : Models, Optimization Algorithms, Combinatorial and Polyhedral Properties / / by Torben Kuschel |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 |
|
|
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Edizione |
[1st ed. 2017.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (XXIX, 286 p. 17 illus., 9 illus. in color.) |
|
|
|
|
|
|
Collana |
|
Lecture Notes in Economics and Mathematical Systems, , 0075-8442 ; ; 686 |
|
|
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Operations research |
Decision making |
Mathematical optimization |
Production management |
Algorithms |
Polytopes |
Combinatorics |
Operations Research/Decision Theory |
Optimization |
Production |
Algorithm Analysis and Problem Complexity |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Nota di bibliografia |
|
Includes bibliographical references and index. |
|
|
|
|
|
|
Nota di contenuto |
|
Introduction -- The Capacitated Planned Maintenance Problem -- Known concepts and solution techniques -- The Weighted Uncapacitated Planned Maintenance Problem -- Analyzing the solvability of the Capacitated Planned Maintenance Problem -- Algorithms for the Capacitated Planned Maintenance Problem -- Computations for the Capacitated Planned Maintenance Problem -- Final remarks and future perspectives. . |
|
|
|
|
|
|
|
|
Sommario/riassunto |
|
This book examines the problem of maintenance planning and scheduling in industrial production systems. It presents two practically relevant, deterministic mathematical models: the capacitated planned maintenance problem (CPMP) and the weighted uncapacitated planned |
|
|
|
|
|
|
|
|
|
|
maintenance problem (WUPMP). It introduces specific optimization algorithms such as construction heuristics, Lagrangean and tabu search metaheuristics. A problem independent hybrid approach links and alternates between two Lagrangean relaxations. It also analyzes the solvability with respect to the computational complexity of several problem classes, polyhedral properties and lower bounds. Computational studies demonstrate the performance of the heuristics, lower bounds, subgradients obtained from heuristics and the quality of dual information. This unique book includes implementation details and an introduction to the necessary theory making it suitable for upper undergraduate students. |
|
|
|
|
|
| |