國立高雄大學圖資館 |

語系: 繁體中文

說明(常見問題)

圖資館首頁

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Capacitated planned maintenancemodel...

Kuschel, Torben.

Capacitated planned maintenancemodels, optimization algorithms, combinatorial and polyhedral properties /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Capacitated planned maintenanceby Torben Kuschel.
其他題名:	models, optimization algorithms, combinatorial and polyhedral properties /
作者:	Kuschel, Torben.
出版者:	Cham :Springer International Publishing :2017.
面頁冊數:	xxix, 286 p. :ill., digital ;24 cm.
Contained By:	Springer eBooks
標題:	Plant maintenancePlanning.
電子資源:	http://dx.doi.org/10.1007/978-3-319-40289-5
ISBN:	9783319402895$q(electronic bk.)

Capacitated planned maintenancemodels, 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 ;461..

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$q(electronic bk.)

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

727906
Plant maintenance
--Planning.

LC Class. No.: TS192 / .K87 2017

Dewey Class. No.: 658.503

Capacitated planned maintenancemodels, optimization algorithms, combinatorial and polyhedral properties /
LDR:02474nmm a2200337 a 4500 001 505449
003 DE-He213
005 20161110021549.0
006 m d
007 cr nn 008maaau
008 171030s2017 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 770820
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 : $b Springer International Publishing : $b Imprint: Springer, $c 2017.
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 727906
650 1 4 $a Business and Management. $2 eflch $3 639169
650 2 4 $a Operation Research/Decision Theory. $3 585050
650 2 4 $a Optimization. $3 274084
650 2 4 $a Production. $3 753152
650 2 4 $a Algorithm Analysis and Problem Complexity. $3 273702
650 2 4 $a Polytopes. $3 205957
650 2 4 $a Combinatorics. $3 274788
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer eBooks
830 0 $a Lecture notes in economics and mathematical systems ; $v 461. $3 434565
856 4 0 $u http://dx.doi.org/10.1007/978-3-319-40289-5
950 $a Business and Management (Springer-41169)