國立高雄大學圖資館 |

語系: 繁體中文

說明(常見問題)

圖資館首頁

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Models and algorithms of time-depend...

Gawiejnowicz, Stanislaw.

Models and algorithms of time-dependent scheduling

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Models and algorithms of time-dependent schedulingby Stanislaw Gawiejnowicz.
作者:	Gawiejnowicz, Stanislaw.
出版者:	Berlin, Heidelberg :Springer Berlin Heidelberg :2020.
面頁冊數:	xxiv, 538 p. :ill., digital ;24 cm.
Contained By:	Springer eBooks
標題:	Production scheduling.
電子資源:	https://doi.org/10.1007/978-3-662-59362-2
ISBN:	9783662593622$q(electronic bk.)

Models and algorithms of time-dependent scheduling
Gawiejnowicz, Stanislaw.

Models and algorithms of time-dependent scheduling[electronic resource] /by Stanislaw Gawiejnowicz. - Second edition. - Berlin, Heidelberg :Springer Berlin Heidelberg :2020. - xxiv, 538 p. :ill., digital ;24 cm. - Monographs in theoretical computer science,1431-2654. - Monographs in theoretical computer science..

Part I, Fundamentals -- Fundamentals -- Preliminaries -- Problems and Algorithms -- NP-Complete Problems -- Part II, Scheduling Models -- The Classical Scheduling Theory -- The Modern Scheduling Theory -- The Time-Dependent Scheduling -- Part III, Polynomial Problems -- Polynomial Single Machine Problems -- Polynomial Parallel Machine Problems -- Polynomial Dedicated Machine Problems -- Part IV, NP-Hard Problems -- NP-Hard Single Machine Problems -- NP-Hard Parallel Machine Problems -- NP-Hard Dedicated Machine Problems -- Part V, Algorithms -- Exact Algorithms -- Approximation Algorithms and Schemes -- Greedy Algorithms Based on Signatures -- Heuristic Algorithms -- Local Search and Meta-heuristic Algorithms -- Part VI, Advanced Topics -- Time-Dependent Scheduling Under Precedence Constraints -- Matrix Methods in Time-Dependent Scheduling -- Bi-criteria Time-Dependent Scheduling -- New Topics in Time-Dependent Scheduling -- App. A, Open Time-Dependent Scheduling Problems -- List of Algorithms -- List of Figures -- List of Tables -- Symbol Index -- Subject Index.

This is a comprehensive study of various time-dependent scheduling problems in single-, parallel- and dedicated-machine environments. In addition to complexity issues and exact or heuristic algorithms which are typically presented in scheduling books, the author also includes more advanced topics such as matrix methods in time-dependent scheduling, time-dependent scheduling with two criteria and time-dependent two-agent scheduling. The reader should be familiar with the basic notions of calculus, discrete mathematics and combinatorial optimization theory, while the book offers introductory material on theory of algorithms, NP-complete problems, and the basics of scheduling theory. The author includes numerous examples, figures and tables, he presents different classes of algorithms using pseudocode, he completes all chapters with extensive bibliographies, and he closes the book with comprehensive symbol and subject indexes. The previous edition of the book focused on computational complexity of time-dependent scheduling problems. In this edition, the author concentrates on models of time-dependent job processing times and algorithms for solving time-dependent scheduling problems. The book is suitable for researchers working on scheduling, problem complexity, optimization, heuristics and local search algorithms.

ISBN: 9783662593622$q(electronic bk.)

Standard No.: 10.1007/978-3-662-59362-2doiSubjects--Topical Terms:

202753
Production scheduling.

LC Class. No.: TS157.5

Dewey Class. No.: 658.53

Models and algorithms of time-dependent scheduling
LDR:03450nmm a2200361 a 4500 001 580389
003 DE-He213
005 20200614071623.0
006 m
007 cr
008 210105s2020
020 $a 9783662593622$q(electronic bk.)
020 $a 9783662593615$q(paper)
024 7 $a 10.1007/978-3-662-59362-2 $2 doi
035 $a 978-3-662-59362-2
040 $a GP $c GP
041 0 $a eng
050 4 $a TS157.5
072 7 $a UY $2 bicssc
072 7 $a COM014000 $2 bisacsh
072 7 $a UY $2 thema
072 7 $a UYA $2 thema
082 0 4 $a 658.53 $2 23
090 $a TS157.5 $b .G284 2020
100 1 $a Gawiejnowicz, Stanislaw. $3 306140
245 1 0 $a Models and algorithms of time-dependent scheduling $h [electronic resource] / $c by Stanislaw Gawiejnowicz.
250 $a Second edition.
260 $a Berlin, Heidelberg : $b Springer Berlin Heidelberg : $b Imprint: Springer, $c 2020.
300 $a xxiv, 538 p. : $b ill., digital ; $c 24 cm.
490 1 $a Monographs in theoretical computer science, $x 1431-2654
505 0 $a Part I, Fundamentals -- Fundamentals -- Preliminaries -- Problems and Algorithms -- NP-Complete Problems -- Part II, Scheduling Models -- The Classical Scheduling Theory -- The Modern Scheduling Theory -- The Time-Dependent Scheduling -- Part III, Polynomial Problems -- Polynomial Single Machine Problems -- Polynomial Parallel Machine Problems -- Polynomial Dedicated Machine Problems -- Part IV, NP-Hard Problems -- NP-Hard Single Machine Problems -- NP-Hard Parallel Machine Problems -- NP-Hard Dedicated Machine Problems -- Part V, Algorithms -- Exact Algorithms -- Approximation Algorithms and Schemes -- Greedy Algorithms Based on Signatures -- Heuristic Algorithms -- Local Search and Meta-heuristic Algorithms -- Part VI, Advanced Topics -- Time-Dependent Scheduling Under Precedence Constraints -- Matrix Methods in Time-Dependent Scheduling -- Bi-criteria Time-Dependent Scheduling -- New Topics in Time-Dependent Scheduling -- App. A, Open Time-Dependent Scheduling Problems -- List of Algorithms -- List of Figures -- List of Tables -- Symbol Index -- Subject Index.
520 $a This is a comprehensive study of various time-dependent scheduling problems in single-, parallel- and dedicated-machine environments. In addition to complexity issues and exact or heuristic algorithms which are typically presented in scheduling books, the author also includes more advanced topics such as matrix methods in time-dependent scheduling, time-dependent scheduling with two criteria and time-dependent two-agent scheduling. The reader should be familiar with the basic notions of calculus, discrete mathematics and combinatorial optimization theory, while the book offers introductory material on theory of algorithms, NP-complete problems, and the basics of scheduling theory. The author includes numerous examples, figures and tables, he presents different classes of algorithms using pseudocode, he completes all chapters with extensive bibliographies, and he closes the book with comprehensive symbol and subject indexes. The previous edition of the book focused on computational complexity of time-dependent scheduling problems. In this edition, the author concentrates on models of time-dependent job processing times and algorithms for solving time-dependent scheduling problems. The book is suitable for researchers working on scheduling, problem complexity, optimization, heuristics and local search algorithms.
650 0 $a Production scheduling. $3 202753
650 0 $a Computer algorithms. $3 184478
650 1 4 $a Theory of Computation. $3 274475
650 2 4 $a Optimization. $3 274084
650 2 4 $a Operations Research/Decision Theory. $3 273963
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer eBooks
830 0 $a Monographs in theoretical computer science. $3 559651
856 4 0 $u https://doi.org/10.1007/978-3-662-59362-2
950 $a Computer Science (Springer-11645)