Capacitated planned maintenance : models, optimization algorithms, combinatorial and polyhedral properties
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 i...
Saved in:
| Main Author: | |
|---|---|
| Format: | eBook |
| Language: | English |
| Published: |
Switzerland :
Springer Verlag,
[2017]
|
| Series: | Lecture notes in economics and mathematical systems.
|
| Subjects: | |
| ISBN: | 9783319402895 9783319402888 |
| Physical Description: | 1 online resource (309 pages) |
Cover
Table of contents
| LEADER | 06301cam a2200517Mi 4500 | ||
|---|---|---|---|
| 001 | 97901 | ||
| 003 | CZ-ZlUTB | ||
| 005 | 20201109180453.0 | ||
| 006 | m o d | ||
| 007 | cr |n|---||||| | ||
| 008 | 161119s2017 sz ob 001 0 eng d | ||
| 040 | |a EBLCP |b eng |e rda |e pn |c EBLCP |d OCLCO |d YDX |d N$T |d IDEBK |d OCLCQ |d N$T |d OCLCO |d IDB |d UAB |d OCLCF |d IOG |d MERER |d ESU |d OCLCQ |d OCLCO |d OTZ |d OCLCQ |d IAS |d JG0 |d U3W |d MERUC |d CAUOI |d KSU |d OCLCQ |d BRX |d OH1 |d VT2 |d COO |d UWW |d UKAHL |d OCLCQ |d SFB | ||
| 020 | |a 9783319402895 |q (electronic bk.) | ||
| 020 | |z 9783319402888 | ||
| 024 | 7 | |a 10.1007/978-3-319-40289-5 |2 doi | |
| 035 | |a (OCoLC)963719205 |z (OCoLC)962750792 |z (OCoLC)962823739 |z (OCoLC)963726446 |z (OCoLC)963736080 |z (OCoLC)964543842 |z (OCoLC)981101710 |z (OCoLC)1197539789 | ||
| 100 | 1 | |a Kuschel, Torben, |e author. | |
| 245 | 1 | 0 | |a Capacitated planned maintenance : |b models, optimization algorithms, combinatorial and polyhedral properties / |c Torben Kuschel. |
| 264 | 1 | |a Switzerland : |b Springer Verlag, |c [2017] | |
| 300 | |a 1 online resource (309 pages) | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a počítač |b c |2 rdamedia | ||
| 338 | |a online zdroj |b cr |2 rdacarrier | ||
| 490 | 1 | |a Lecture Notes in Economics and Mathematical Systems ; |v v. 686 | |
| 505 | 0 | |a Preface; Contents; List of Algorithms; List of Figures; List of Tables; Abbreviations; 1 Introduction; References; 2 The Capacitated Planned Maintenance Problem; 2.1 Problem Definition and Motivation; 2.2 Known Maintenance Problems; 2.2.1 Periodic Maintenance; 2.2.2 Machine Scheduling with Periodic Maintenance; 2.2.3 Periodic Maintenance Inspection; 2.2.4 Aircraft Maintenance; 2.2.5 Other Maintenance Approaches; 2.3 The Mathematical Formulation; 2.3.1 Assumptions and Terminology; 2.3.2 Data Structure; References; 3 Known Concepts and Solution Techniques; 3.1 Computational Complexity. | |
| 505 | 8 | |a 3.2 Linear and Integer Programming3.2.1 The Simplex Algorithm; 3.2.2 The Primal-Dual Simplex Algorithm; 3.3 Dual Decomposition: Lagrangean Relaxation; 3.3.1 Column Generation; 3.3.2 Subgradient Optimization; 3.4 Primal Decomposition: Benders' Reformulation; 3.5 Local Search and Tabu Search; 3.5.1 Local Search; 3.5.2 Tabu Search; 3.6 The Knapsack Problem; 3.6.1 Valid Inequalities; 3.6.2 Lower and Upper Bounds; 3.6.3 An Exact Algorithm; References; 4 The Weighted Uncapacitated Planned Maintenance Problem; 4.1 The Mathematical Formulation; 4.2 Polyhedral Properties; 4.3 Computational Complexity. | |
| 505 | 8 | |a 4.4 The Single Weighted Uncapacitated Planned Maintenance Problem4.4.1 An Optimal Solution to the Primal Problem; 4.4.2 An Optimal Solution to the Corresponding Dual Problem of the LP Relaxation; 4.5 The Uncapacitated Planned Maintenance Problem; References; 5 Analyzing the Solvability of the Capacitated Planned Maintenance Problem; 5.1 Valid Inequalities and Polyhedral Properties; 5.2 Computational Complexity; 5.3 Lower Bounds; 5.3.1 Considered Lower Bounds; 5.3.2 Relative Strengths and Computational Complexity; 5.3.3 Transformations of the Lower Bounds; 5.3.3.1 Network Flow Problems. | |
| 505 | 8 | |a 5.3.3.2 Facility Location Problems5.3.4 Mathematical Formulations of the Lagrangean Duals; 5.3.4.1 Lagrangean Duals Z(P)+(Q)(R) and Z(P)(X)+(Q)(R) ; 5.3.4.2 Lagrangean Dual Z(P) ; 5.3.4.3 Lagrangean Dual Z(C) ; 5.3.4.4 Lagrangean Dual Z(P)/(C) ; 5.3.4.5 Lagrangean Dual Z(Y)(V) ; References; 6 Algorithms for the Capacitated Planned Maintenance Problem; 6.1 Three Construction Heuristics; 6.1.1 The First Fit Heuristic; 6.1.2 The Overlap Heuristic; 6.1.3 The Iterated Best-of-Three Heuristic; 6.2 Two Lagrangean Heuristics; 6.2.1 The Lagrangean Relaxation of the Capacity Constraint. | |
| 505 | 8 | |a 6.2.1.1 The LP Lower Bound6.2.1.2 The Dual Priority Rule Lower Bound; 6.2.1.3 The Combined Lower Bound; 6.2.1.4 The Primal-Dual Lower Bound; 6.2.1.5 The Shortest Path Lower Bound; 6.2.1.6 The Upper Bound Heuristic; 6.2.2 The Lagrangean Relaxation of the Period Covering Constraint; 6.2.3 The Lagrangean Heuristic for Both Relaxations; 6.2.3.1 Initial Lagrangean Multiplier; 6.2.3.2 A Lagrangean Heuristic; 6.3 A More Sophisticated Lagrangean Hybrid Heuristic; 6.3.1 A General Approach to Link Two Lagrangean Relaxations ; 6.3.2 The Lagrangean Hybrid Heuristic. | |
| 500 | |a 6.3.2.1 Initial Extended Cover Inequalities. | ||
| 506 | |a Plný text je dostupný pouze z IP adres počítačů Univerzity Tomáše Bati ve Zlíně nebo vzdáleným přístupem pro zaměstnance a studenty | ||
| 520 | |a 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. | ||
| 504 | |a Includes bibliographical references and index. | ||
| 590 | |a SpringerLink |b Springer Complete eBooks | ||
| 650 | 0 | |a Plant maintenance |x Planning. | |
| 650 | 0 | |a Production management. | |
| 650 | 0 | |a Operations research. | |
| 650 | 0 | |a Decision making. | |
| 650 | 0 | |a Algorithms. | |
| 655 | 7 | |a elektronické knihy |7 fd186907 |2 czenas | |
| 655 | 9 | |a electronic books |2 eczenas | |
| 776 | 0 | 8 | |i Print version: |a Kuschel, Torben. |t Capacitated Planned Maintenance : Models, Optimization Algorithms, Combinatorial and Polyhedral Properties. |d Cham : Springer International Publishing, ©2016 |z 9783319402888 |w (OCoLC)950952798 |
| 830 | 0 | |a Lecture notes in economics and mathematical systems. | |
| 856 | 4 | 0 | |u https://proxy.k.utb.cz/login?url=https://link.springer.com/10.1007/978-3-319-40289-5 |y Plný text |
| 992 | |c NTK-SpringerBM | ||
| 999 | |c 97901 |d 97901 | ||
Save to List
Cite this
Export Record
Email this