Las cookies nos ayudan a ofrecer nuestros servicios. Al utilizar nuestros servicios, aceptas el uso de cookies.

Editorial Cuvillier

Publicaciones, tesis doctorales, capacitaciónes para acceder a una cátedra de universidad & prospectos.
Su editorial internacional especializado en ciencias y economia

Editorial Cuvillier

De En Es
Optimal Scheduling with Nested Time Intervals and Three-Dimensional Strip Packing on Compara-bility Graphs of an Arborescence Order

Impresion
EUR 37,80

E-Book
EUR 26,46

Optimal Scheduling with Nested Time Intervals and Three-Dimensional Strip Packing on Compara-bility Graphs of an Arborescence Order (Tienda española)

Thomas Rieger (Autor)

Previo

Indice, PDF (48 KB)
Lectura de prueba, PDF (110 KB)

ISBN-13 (Impresion) 9783736990357
ISBN-13 (E-Book) 9783736980358
Idioma Inglés
Numero de paginas 164
Laminacion de la cubierta Brillante
Edicion 1. Aufl.
Lugar de publicacion Göttingen
Lugar de la disertacion Braunschweig
Fecha de publicacion 13.07.2015
Clasificacion simple Tesis doctoral
Area Matemática
Matemática aplicada
Palabras claves Scheduling, Strip Packing, Discrete Optimization, Mixed Integer Programming
Descripcion

This thesis is concerned with scheduling and three-dimensional packing problems that arise when restricting to nested intervals – either for allocating jobs to time intervals (at machines) or for positioning boxes within a strip. The scheduling problems considered in the first part of this work are motivated by a real-world application in rail car maintenance, and result in a new type of job characteristic introduced into the methodology of scheduling. Being classified as strip packing problems on comparability graphs of an arborescence order, the packing problems of the second part of this thesis are further structurally characterized based on the concept of packing classes. It turns out that using this characterization, these packing problems can equivalently be solved by interval coloring adequate chordal graphs. For several variants of above-mentioned mathematical optimization problems complexity results are derived and approximation, pure heuristical as well as exact solution approaches presented. The performance of the approaches is finally discussed based on computational results.