國立虎尾科技大學 |

Capacitated planned maintenance = models, optimization algorithms, combinatorial and polyhedral properties /

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Capacitated planned maintenance/ by Torben Kuschel.
Reminder of title:	models, optimization algorithms, combinatorial and polyhedral properties /
Author:	Kuschel, Torben.
Published:	Cham :Springer International Publishing : : 2017.,
Description:	xxix, 286 p. :ill., digital ; : 24 cm.;
Contained By:	Springer eBooks
Subject:	Plant maintenance - Planning. -
Online resource:	http://dx.doi.org/10.1007/978-3-319-40289-5
ISBN:	9783319402895

Capacitated planned maintenance = models, optimization algorithms, combinatorial and polyhedral properties /
Kuschel, Torben.

Capacitated planned maintenancemodels, optimization algorithms, combinatorial and polyhedral properties /[electronic resource] :by Torben Kuschel. - Cham :Springer International Publishing :2017. - xxix, 286 p. :ill., digital ;24 cm. - Lecture notes in economics and mathematical systems,6860075-8442 ;. - Lecture notes in economics and mathematical systems ;664..

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.

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.

ISBN: 9783319402895

Standard No.: 10.1007/978-3-319-40289-5doiSubjects--Topical Terms:

636686
Plant maintenance
--Planning.

LC Class. No.: TS192 / .K87 2017

Dewey Class. No.: 658.503

Capacitated planned maintenance = models, optimization algorithms, combinatorial and polyhedral properties /
LDR:02474nam a2200337 a 4500 001 957028
003 DE-He213
005 20161110021549.0
006 m d
007 cr nn 008maaau
008 201118s2017 gw s 0 eng d
020 $a 9783319402895 $q (electronic bk.)
020 $a 9783319402888 $q (paper)
024 7 $a 10.1007/978-3-319-40289-5 $2 doi
035 $a 978-3-319-40289-5
040 $a GP $c GP
041 0 $a eng
050 4 $a TS192 $b .K87 2017
072 7 $a KJT $2 bicssc
072 7 $a KJMD $2 bicssc
072 7 $a BUS049000 $2 bisacsh
082 0 4 $a 658.503 $2 23
090 $a TS192 $b .K97 2017
100 1 $a Kuschel, Torben. $3 1248433
245 1 0 $a Capacitated planned maintenance $h [electronic resource] : $b models, optimization algorithms, combinatorial and polyhedral properties / $c by Torben Kuschel.
260 $a Cham : $c 2017. $b Springer International Publishing : $b Imprint: Springer,
300 $a xxix, 286 p. : $b ill., digital ; $c 24 cm.
490 1 $a Lecture notes in economics and mathematical systems, $x 0075-8442 ; $v 686
505 0 $a 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.
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.
650 0 $a Plant maintenance $x Planning. $3 636686
650 1 4 $a Business and Management. $2 eflch $3 934826
650 2 4 $a Operation Research/Decision Theory. $3 881408
650 2 4 $a Optimization. $3 669174
650 2 4 $a Production. $3 1111231
650 2 4 $a Algorithm Analysis and Problem Complexity. $3 593923
650 2 4 $a Polytopes. $3 884204
650 2 4 $a Combinatorics. $3 669353
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer eBooks
830 0 $a Lecture notes in economics and mathematical systems ; $v 664. $3 881682
856 4 0 $u http://dx.doi.org/10.1007/978-3-319-40289-5
950 $a Business and Management (Springer-41169)