東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Combinatorial optimization problems ...

Zgurovsky, Michael Z.

FindBook

Google Book

Amazon

博客來

Combinatorial optimization problems in planning and decision making = theory and applications /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Combinatorial optimization problems in planning and decision making/ by Michael Z. Zgurovsky, Alexander A. Pavlov.
其他題名:	theory and applications /
作者:	Zgurovsky, Michael Z.
其他作者:	Pavlov, Alexander A.
出版者:	Cham :Springer International Publishing : : 2019.,
面頁冊數:	xiv, 518 p. :ill., digital ;24 cm.
內容註:	Part I Intractable combinatorial optimization problems. PSC-algorithms -- Optimal scheduling for two criteria for a single machine with arbitrary due dates -- Optimal tasks execution for two criteria with a common due date on parallel machines -- Optimal scheduling for the vector criterion for parallel machines with arbitrary due dates -- The total weighted tardiness of tasks minimization on a single machine -- The total earliness/tardiness minimization on a single machine with arbitrary due dates -- The total tardiness of tasks minimization on identical parallel machines with a common due date -- Minimization of the maximum earliness/tardiness of tasks on identical parallel machines with a common due date -- The total weighted completion time of tasks minimization with precedence relations on a single machine -- Part II: Hierarchical planning and decision making in network systems with limited resources -- The four-level model of planning and decision making -- Algorithmic support of the four-level model of planning and decision making -- Models and methods of decision making with non-formalized goals -- Project 1. Informational Decision Support System for the project management in software development -- Project 2. Universal hierarchical system of scheduling and operational planning for the small-scale type of productions.
Contained By:	Springer eBooks
標題:	Combinatorial optimization. -
電子資源:	https://doi.org/10.1007/978-3-319-98977-8
ISBN:	9783319989778

Combinatorial optimization problems in planning and decision making = theory and applications /
Zgurovsky, Michael Z.

Combinatorial optimization problems in planning and decision makingtheory and applications /[electronic resource] :by Michael Z. Zgurovsky, Alexander A. Pavlov. - Cham :Springer International Publishing :2019. - xiv, 518 p. :ill., digital ;24 cm. - Studies in systems, decision and control,v.1732198-4182 ;. - Studies in systems, decision and control ;v.173..

Part I Intractable combinatorial optimization problems. PSC-algorithms -- Optimal scheduling for two criteria for a single machine with arbitrary due dates -- Optimal tasks execution for two criteria with a common due date on parallel machines -- Optimal scheduling for the vector criterion for parallel machines with arbitrary due dates -- The total weighted tardiness of tasks minimization on a single machine -- The total earliness/tardiness minimization on a single machine with arbitrary due dates -- The total tardiness of tasks minimization on identical parallel machines with a common due date -- Minimization of the maximum earliness/tardiness of tasks on identical parallel machines with a common due date -- The total weighted completion time of tasks minimization with precedence relations on a single machine -- Part II: Hierarchical planning and decision making in network systems with limited resources -- The four-level model of planning and decision making -- Algorithmic support of the four-level model of planning and decision making -- Models and methods of decision making with non-formalized goals -- Project 1. Informational Decision Support System for the project management in software development -- Project 2. Universal hierarchical system of scheduling and operational planning for the small-scale type of productions.

The book focuses on the next fields of computer science: combinatorial optimization, scheduling theory, decision theory, and computer-aided production management systems. It also offers a quick introduction into the theory of PSC-algorithms, which are a new class of efficient methods for intractable problems of combinatorial optimization. A PSC-algorithm is an algorithm which includes: sufficient conditions of a feasible solution optimality for which their checking can be implemented only at the stage of a feasible solution construction, and this construction is carried out by a polynomial algorithm (the first polynomial component of the PSC-algorithm); an approximation algorithm with polynomial complexity (the second polynomial component of the PSC-algorithm); also, for NP-hard combinatorial optimization problems, an exact subalgorithm if sufficient conditions were found, fulfilment of which during the algorithm execution turns it into a polynomial complexity algorithm. Practitioners and software developers will find the book useful for implementing advanced methods of production organization in the fields of planning (including operative planning) and decision making. Scientists, graduate and master students, or system engineers who are interested in problems of combinatorial optimization, decision making with poorly formalized overall goals, or a multiple regression construction will benefit from this book.

ISBN: 9783319989778

Standard No.: 10.1007/978-3-319-98977-8doiSubjects--Topical Terms:

544215
Combinatorial optimization.

LC Class. No.: QA402.5 / .Z487 2019

Dewey Class. No.: 519

Combinatorial optimization problems in planning and decision making = theory and applications /
LDR:03877nmm a2200337 a 4500 001 2177238
003 DE-He213
005 20190521091359.0
006 m d
007 cr nn 008maaau
008 191122s2019 gw s 0 eng d
020 $a 9783319989778 $q (electronic bk.)
020 $a 9783319989761 $q (paper)
024 7 $a 10.1007/978-3-319-98977-8 $2 doi
035 $a 978-3-319-98977-8
040 $a GP $c GP
041 0 $a eng
050 4 $a QA402.5 $b .Z487 2019
072 7 $a TBJ $2 bicssc
072 7 $a MAT003000 $2 bisacsh
072 7 $a TBJ $2 thema
082 0 4 $a 519 $2 23
090 $a QA402.5 $b .Z63 2019
100 1 $a Zgurovsky, Michael Z. $3 3295482
245 1 0 $a Combinatorial optimization problems in planning and decision making $h [electronic resource] : $b theory and applications / $c by Michael Z. Zgurovsky, Alexander A. Pavlov.
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2019.
300 $a xiv, 518 p. : $b ill., digital ; $c 24 cm.
490 1 $a Studies in systems, decision and control, $x 2198-4182 ; $v v.173
505 0 $a Part I Intractable combinatorial optimization problems. PSC-algorithms -- Optimal scheduling for two criteria for a single machine with arbitrary due dates -- Optimal tasks execution for two criteria with a common due date on parallel machines -- Optimal scheduling for the vector criterion for parallel machines with arbitrary due dates -- The total weighted tardiness of tasks minimization on a single machine -- The total earliness/tardiness minimization on a single machine with arbitrary due dates -- The total tardiness of tasks minimization on identical parallel machines with a common due date -- Minimization of the maximum earliness/tardiness of tasks on identical parallel machines with a common due date -- The total weighted completion time of tasks minimization with precedence relations on a single machine -- Part II: Hierarchical planning and decision making in network systems with limited resources -- The four-level model of planning and decision making -- Algorithmic support of the four-level model of planning and decision making -- Models and methods of decision making with non-formalized goals -- Project 1. Informational Decision Support System for the project management in software development -- Project 2. Universal hierarchical system of scheduling and operational planning for the small-scale type of productions.
520 $a The book focuses on the next fields of computer science: combinatorial optimization, scheduling theory, decision theory, and computer-aided production management systems. It also offers a quick introduction into the theory of PSC-algorithms, which are a new class of efficient methods for intractable problems of combinatorial optimization. A PSC-algorithm is an algorithm which includes: sufficient conditions of a feasible solution optimality for which their checking can be implemented only at the stage of a feasible solution construction, and this construction is carried out by a polynomial algorithm (the first polynomial component of the PSC-algorithm); an approximation algorithm with polynomial complexity (the second polynomial component of the PSC-algorithm); also, for NP-hard combinatorial optimization problems, an exact subalgorithm if sufficient conditions were found, fulfilment of which during the algorithm execution turns it into a polynomial complexity algorithm. Practitioners and software developers will find the book useful for implementing advanced methods of production organization in the fields of planning (including operative planning) and decision making. Scientists, graduate and master students, or system engineers who are interested in problems of combinatorial optimization, decision making with poorly formalized overall goals, or a multiple regression construction will benefit from this book.
650 0 $a Combinatorial optimization. $3 544215
650 0 $a Problem solving. $3 516855
650 1 4 $a Mathematical and Computational Engineering. $3 3226306
650 2 4 $a Computer-Aided Engineering (CAD, CAE) and Design. $3 892568
650 2 4 $a Industrial and Production Engineering. $3 891024
650 2 4 $a Operations Research/Decision Theory. $3 890895
700 1 $a Pavlov, Alexander A. $3 3380093
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer eBooks
830 0 $a Studies in systems, decision and control ; $v v.173. $3 3380094
856 4 0 $u https://doi.org/10.1007/978-3-319-98977-8
950 $a Engineering (Springer-11647)