Articles liés à Models and Algorithms of Time-Dependent Scheduling
Synopsis
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.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
- ÉditeurSpringer
- Date d'édition2021
- ISBN 10 3662593645
- ISBN 13 9783662593646
- ReliureBroché
- Langueanglais
- Numéro d'édition2
- Nombre de pages564
- Coordonnées du fabricantnon disponible
Acheter neuf
Afficher cet article
EUR 136,16
EUR 9,70 expédition depuis Allemagne vers France
Destinations, frais et délais
Résultats de recherche pour Models and Algorithms of Time-Dependent Scheduling
Image fournie par le vendeur
Models and Algorithms of Time-Dependent Scheduling
Edité par
Springer Berlin Heidelberg, 2021
ISBN 10 : 3662593645
ISBN 13 : 9783662593646
Neuf
Couverture souple
Vendeur : moluna, Greven, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Time-dependent scheduling involves problems in which the processing times of jobs depend on when those jobs are startedAuthor includes numerous examples, figures and tables, and different classes of algorithms presented using pseudocodePrev. N° de réf. du vendeur 474795831
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Models and Algorithms of Time-Dependent Scheduling
Edité par
Springer Berlin Heidelberg, 2021
ISBN 10 : 3662593645
ISBN 13 : 9783662593646
Neuf
Taschenbuch
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. N° de réf. du vendeur 9783662593646
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Models and Algorithms of Time-Dependent Scheduling
Edité par
Springer Berlin Heidelberg Jul 2021, 2021
ISBN 10 : 3662593645
ISBN 13 : 9783662593646
Neuf
Taschenbuch
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 564 pp. Englisch. N° de réf. du vendeur 9783662593646
Quantité disponible : 2 disponible(s)
Image d'archives
Models and Algorithms of Time-Dependent Scheduling (Monographs in Theoretical Computer Science. An EATCS Series)
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. In. N° de réf. du vendeur ria9783662593646_new
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Models and Algorithms of Time-Dependent Scheduling
Edité par
Springer Berlin Heidelberg, Springer Berlin Heidelberg Jul 2021, 2021
ISBN 10 : 3662593645
ISBN 13 : 9783662593646
Neuf
Taschenbuch
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. Neuware -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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 564 pp. Englisch. N° de réf. du vendeur 9783662593646
Quantité disponible : 2 disponible(s)
Image d'archives
Models and Algorithms of Time-Dependent Scheduling (Monographs in Theoretical Computer Science. An EATCS Series)
Vendeur : Lucky's Textbooks, Dallas, TX, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. N° de réf. du vendeur ABLIING23Mar3113020318094
Quantité disponible : Plus de 20 disponibles
Image d'archives
Models and Algorithms of Time-dependent Scheduling
Edité par
Springer-Nature New York Inc, 2021
ISBN 10 : 3662593645
ISBN 13 : 9783662593646
Neuf
Paperback
Vendeur : Revaluation Books, Exeter, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Paperback. Etat : Brand New. 2nd edition. 562 pages. 9.25x6.10x1.28 inches. In Stock. N° de réf. du vendeur x-3662593645
Quantité disponible : 2 disponible(s)