000 04364nam a22005415i 4500
001 978-3-662-59362-2
003 DE-He213
005 20240423125220.0
007 cr nn 008mamaa
008 200613s2020 gw | s |||| 0|eng d
020 _a9783662593622
_9978-3-662-59362-2
024 7 _a10.1007/978-3-662-59362-2
_2doi
050 4 _aQA75.5-76.95
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYA
_2thema
082 0 4 _a004.0151
_223
100 1 _aGawiejnowicz, Stanisław.
_eauthor.
_4aut
_4http://id.loc.gov/vocabulary/relators/aut
245 1 0 _aModels and Algorithms of Time-Dependent Scheduling
_h[electronic resource] /
_cby Stanisław Gawiejnowicz.
250 _a2nd ed. 2020.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2020.
300 _aXXIV, 538 p. 24 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aMonographs in Theoretical Computer Science. An EATCS Series,
_x2193-2069
505 0 _aPart 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 _aThis 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 _aComputer science.
650 0 _aMathematical optimization.
650 0 _aOperations research.
650 1 4 _aTheory of Computation.
650 2 4 _aOptimization.
650 2 4 _aOperations Research and Decision Theory.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783662593615
776 0 8 _iPrinted edition:
_z9783662593639
776 0 8 _iPrinted edition:
_z9783662593646
830 0 _aMonographs in Theoretical Computer Science. An EATCS Series,
_x2193-2069
856 4 0 _uhttps://doi.org/10.1007/978-3-662-59362-2
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
942 _cSPRINGER
999 _c175512
_d175512