國立虎尾科技大學 |

Models and Algorithms of Time-Dependent Scheduling

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Models and Algorithms of Time-Dependent Scheduling/ by Stanisław Gawiejnowicz.
作者:	Gawiejnowicz, Stanisław.
面頁冊數:	XXIV, 538 p. 24 illus.online resource. :
Contained By:	Springer Nature eBook
標題:	Operations Research/Decision Theory. -
電子資源:	https://doi.org/10.1007/978-3-662-59362-2
ISBN:	9783662593622

Models and Algorithms of Time-Dependent Scheduling
Gawiejnowicz, Stanisław.

Models and Algorithms of Time-Dependent Scheduling[electronic resource] /by Stanisław Gawiejnowicz. - 2nd ed. 2020. - XXIV, 538 p. 24 illus.online resource. - Monographs in Theoretical Computer Science. An EATCS Series,1431-2654. - Monographs in Theoretical Computer Science. An EATCS Series,.

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

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

669176
Operations Research/Decision Theory.

LC Class. No.: QA75.5-76.95

Dewey Class. No.: 004.0151

Models and Algorithms of Time-Dependent Scheduling
LDR:03888nam a22004335i 4500 001 1028626
003 DE-He213
005 20200705004410.0
007 cr nn 008mamaa
008 210318s2020 gw | s |||| 0|eng d
020 $a 9783662593622 $9 978-3-662-59362-2
024 7 $a 10.1007/978-3-662-59362-2 $2 doi
035 $a 978-3-662-59362-2
050 4 $a QA75.5-76.95
050 4 $a QA76.63
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 004.0151 $2 23
100 1 $a Gawiejnowicz, Stanisław. $e author. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1325203
245 1 0 $a Models and Algorithms of Time-Dependent Scheduling $h [electronic resource] / $c by Stanisław Gawiejnowicz.
250 $a 2nd ed. 2020.
264 1 $a Berlin, Heidelberg : $b Springer Berlin Heidelberg : $b Imprint: Springer, $c 2020.
300 $a XXIV, 538 p. 24 illus. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a Monographs in Theoretical Computer Science. An EATCS Series, $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 2 4 $a Operations Research/Decision Theory. $3 669176
650 2 4 $a Optimization. $3 669174
650 1 4 $a Theory of Computation. $3 669322
650 0 $a Decision making. $3 528319
650 0 $a Operations research. $3 573517
650 0 $a Mathematical optimization. $3 527675
650 0 $a Computers. $3 565115
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783662593615
776 0 8 $i Printed edition: $z 9783662593639
776 0 8 $i Printed edition: $z 9783662593646
830 0 $a Monographs in Theoretical Computer Science. An EATCS Series, $x 1431-2654 $3 1261131
856 4 0 $u https://doi.org/10.1007/978-3-662-59362-2
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)