Cantitate/Preț
Produs
Total produse
Vezi coșul
Models and Algorithms of Time-Dependent Scheduling de Stanisław Gawiejnowicz

Models and Algorithms of Time-Dependent Scheduling: Monographs in Theoretical Computer Science. An EATCS Series

Autor Stanisław Gawiejnowicz
en Limba Engleză Hardback – 14 iun 2020
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 ofthe 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.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (1) 97147 lei  43-57 zile
  Springer Berlin, Heidelberg – 16 iul 2021 97147 lei  43-57 zile
Hardback (1) 97791 lei  43-57 zile
  Springer Berlin, Heidelberg – 14 iun 2020 97791 lei  43-57 zile

Din seria Monographs in Theoretical Computer Science. An EATCS Series

Preț: 97791 lei

Preț vechi: 122238 lei
-20% Nou

Puncte Express: 1467
Preț estimativ în valută:
18717€ • 19508$ • 15581£

Carte tipărită la comandă

Livrare economică 06-20 ianuarie 25

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783662593615
ISBN-10: 3662593610
Pagini: 538
Ilustrații: XXIV, 538 p. 24 illus.
Dimensiuni: 155 x 235 mm
Greutate: 0.96 kg
Ediția:2nd ed. 2020
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Monographs in Theoretical Computer Science. An EATCS Series

Locul publicării:Berlin, Heidelberg, Germany

Cuprins

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.

Recenzii

“The book presents a lot of material for time dependent scheduling, it is full of algorithms (in pseudo-code) and of complexity proofs, it provides a deep insight to the theory and practice of scheduling.” (Helmut G. Kahlbacher, zbMATH 1453.90002, 2021)

Textul de pe ultima copertă

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.

Caracteristici

Time-dependent scheduling involves problems in which the processing times of jobs depend on when those jobs are started Author includes numerous examples, figures and tables, and different classes of algorithms presented using pseudocode Previous edition focused on computational complexity of time-dependent scheduling problems, this edition concentrates on models of time-dependent job processing times and algorithms for solving scheduling problems