Imagen de portada de Amazon
Imagen de Amazon.com

Handbook of scheduling Algorithms, models and performance analysis

Por: Boca Raton Crc Press 2004Descripción: 1120 páginasTipo de contenido:
  • texto
Tipo de medio:
  • no mediado
Tipo de soporte:
  • volumen
ISBN:
  • 1-58488-397-9
Tema(s): Clasificación CDD:
  • 658.54 / H153
Contenidos:
Introduction and notation, cap.1 A tutorial on complexity, cap.2 Some basic scheduling algorithms, cap.3 Elimination rules for job-shop scheduling problem: Overview and extensions, cap.4 Flexible hybrid flowshops, cap.5 Open shop scheduling, cap.6 Cycle shop scheduling, cap.7 Reducibility among scheduling classes, cap.8 Parallel scheduling for early completion, cap.9 Minimizing the maximun lateness, cap.10 Approximation algorithms for minimizing average weighted completion time, cap.11 Minimizing the number of tardy jobs, cap.12 Branch-and-Bound algorithms for total weighted tardiness, cap.13 Scheduling equal processing time jobs, cap.14 Online scheduling, cap.15 Convex quadratic relaxations in scheduling, cap.16 The master-slave scheduling model, cap.17 Scheduling in bluetooth networks, cap.18 Fair sequences, cap.19 Due date quotation models and algorithms, cap.20 Scheduling with due date assignment, cap.21 Machine scheduling with availability constraints, cap.22 Scheduling with discrete resource constraints, cap.23 Scheduling with resource constraints - continuous resources, cap.24 Scheduling parallel tasks - algorithms and complexity, cap.25 Scheduling parallel tasks approximation algorithms, cap.26 The pinwheel: A real-time scheduling problem, cap.27 Scheduling real-time tasks: Algorithms and complexity, cap.28 Real-time synchronization protocols, cap.29 A categorization of real-time multiprocessor scheduling problems and algorithms, cap.30 Fair scheduling of real-time tasks on multiprocessors, cap.31 Approximation algorithms for scheduling time-critical jobs on multiprocessor systems, cap.32 Scheduling overloaded real-time systems with competitive/worst case guarantees, cap.33 Minimizing total weighted error for imprecise computation tasks and related problems, cap.34 Dual criteria optimization problems for imprecise computation tasks, cap.35 Periodic reward-based scheduling and its application to power-aware real-time systems, cap.36 Routing real-time messages on networks, cap.37 Offline deterministic scheduling, stochastic scheduling and online deterministic scheduling: A comparative overview, cap.38 Stochastic scheduling with earlines and tardiness penalties, cap.39 Developments in queueing networks with tractable solutions, cap.40 Scheduling in secondary storage systems, cap.41 Selfish routing on the internet, cap.42 Scheduling of flexible resources in professional service firms, cap.43 Novel metaheuristic approaches to nurse rostering problems, cap.44 University timebabling, cap.45 Adapting the Gates architecture to scheduling faqculty, cap.46 Constraint programming for scheduling, cap.47 Batch production scheduling in the process industries, cap.48 A composite very-large-scale neighborhood search algorithm for the vehicle routing problem, cap.49 Scheduling problems in the airline industry, cap.50 Bus and train driver scheduling, cap.51 Sports scheduling, cap.52
Etiquetas de esta biblioteca: No hay etiquetas de esta biblioteca para este título. Ingresar para agregar etiquetas.
Valoración
    Valoración media: 0.0 (0 votos)
Existencias
Tipo de ítem Biblioteca actual Colección Signatura topográfica Copia número Estado Notas Fecha de vencimiento Código de barras
Libro general Libro general Biblioteca Uniagraria General 658.54 / H153 (Navegar estantería(Abre debajo)) Ej. 1 Disponible 70 0100016714
Libro reserva Libro reserva Biblioteca Uniagraria Reserva 658.54 / H153 (Navegar estantería(Abre debajo)) Ej. 2 Disponible 70 0100016713

Introduction and notation, cap.1 A tutorial on complexity, cap.2 Some basic scheduling algorithms, cap.3 Elimination rules for job-shop scheduling problem: Overview and extensions, cap.4 Flexible hybrid flowshops, cap.5 Open shop scheduling, cap.6 Cycle shop scheduling, cap.7 Reducibility among scheduling classes, cap.8 Parallel scheduling for early completion, cap.9 Minimizing the maximun lateness, cap.10 Approximation algorithms for minimizing average weighted completion time, cap.11 Minimizing the number of tardy jobs, cap.12 Branch-and-Bound algorithms for total weighted tardiness, cap.13 Scheduling equal processing time jobs, cap.14 Online scheduling, cap.15 Convex quadratic relaxations in scheduling, cap.16 The master-slave scheduling model, cap.17 Scheduling in bluetooth networks, cap.18 Fair sequences, cap.19 Due date quotation models and algorithms, cap.20 Scheduling with due date assignment, cap.21 Machine scheduling with availability constraints, cap.22 Scheduling with discrete resource constraints, cap.23 Scheduling with resource constraints - continuous resources, cap.24 Scheduling parallel tasks - algorithms and complexity, cap.25 Scheduling parallel tasks approximation algorithms, cap.26 The pinwheel: A real-time scheduling problem, cap.27 Scheduling real-time tasks: Algorithms and complexity, cap.28 Real-time synchronization protocols, cap.29 A categorization of real-time multiprocessor scheduling problems and algorithms, cap.30 Fair scheduling of real-time tasks on multiprocessors, cap.31 Approximation algorithms for scheduling time-critical jobs on multiprocessor systems, cap.32 Scheduling overloaded real-time systems with competitive/worst case guarantees, cap.33 Minimizing total weighted error for imprecise computation tasks and related problems, cap.34 Dual criteria optimization problems for imprecise computation tasks, cap.35 Periodic reward-based scheduling and its application to power-aware real-time systems, cap.36 Routing real-time messages on networks, cap.37 Offline deterministic scheduling, stochastic scheduling and online deterministic scheduling: A comparative overview, cap.38 Stochastic scheduling with earlines and tardiness penalties, cap.39 Developments in queueing networks with tractable solutions, cap.40 Scheduling in secondary storage systems, cap.41 Selfish routing on the internet, cap.42 Scheduling of flexible resources in professional service firms, cap.43 Novel metaheuristic approaches to nurse rostering problems, cap.44 University timebabling, cap.45 Adapting the Gates architecture to scheduling faqculty, cap.46 Constraint programming for scheduling, cap.47 Batch production scheduling in the process industries, cap.48 A composite very-large-scale neighborhood search algorithm for the vehicle routing problem, cap.49 Scheduling problems in the airline industry, cap.50 Bus and train driver scheduling, cap.51 Sports scheduling, cap.52

No hay comentarios en este titulo.

para colocar un comentario.