Artículos relacionados a Scheduling Algorithms
Sinopsis
Besides scheduling problems for single and parallel machines and shop scheduling problems, this study covers advanced models involving due-dates, sequence-dependent changeover times and batching. It also discusses multiprocessor task scheduling and problems with multipurpose machines. The methods used to solve these problems are linear programming, branch-and-bound algorithms, and local search heuristics. Complexity results for the different classes of deterministic scheduling problems are summarized.
"Sinopsis" puede pertenecer a otra edición de este libro.
Reseña del editor
Besides scheduling problems for single and parallel machines and shop scheduling problems, this study covers advanced models involving due-dates, sequence-dependent changeover times and batching. It also discusses multiprocessor task scheduling and problems with multipurpose machines. The methods used to solve these problems are linear programming, branch-and-bound algorithms, and local search heuristics. Complexity results for the different classes of deterministic scheduling problems are summarized.
"Sobre este título" puede pertenecer a otra edición de este libro.
Otras ediciones populares con el mismo título
Resultados de la búsqueda para Scheduling Algorithms
Imagen de archivo
Scheduling Algorithms
Publicado por
Springer-Verlag Berlin and Heidelberg GmbH & Co. K, 1998
ISBN 10: 354064105X
ISBN 13: 9783540641056
Antiguo o usado
Tapa dura
Librería: Ammareal, Morangis, Francia
Calificación del vendedor: 5 de 5 estrellas
Hardcover. Condición: Très bon. Ancien livre de bibliothèque. Légères traces d'usure sur la couverture. Couverture différente. Edition 1998. Ammareal reverse jusqu'à 15% du prix net de cet article à des organisations caritatives. ENGLISH DESCRIPTION Book Condition: Used, Very good. Former library book. Slight signs of wear on the cover. Different cover. Edition 1998. Ammareal gives back up to 15% of this item's net price to charity organizations. Nº de ref. del artículo: E-505-605
Cantidad disponible: 1 disponibles