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

Rieger, Thomas

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

Couverture souple

ISBN 10 : 3736990359 ISBN 13 : 9783736990357

Editeur : Cuvillier Verlag, 2015

Afficher les exemplaires de cette �dition comportant l?ISBN

0 D'occasion

5 Neuf

De EUR 37,80

D�tails de l'�dition

�diteur: Cuvillier Verlag
Date d'�dition: 2015
Langue: anglais
ISBN 10: 3736990359
ISBN 13: 9783736990357
Reliure: Broch�
Nombre de pages: 164
Coordonn�es du fabricant: non disponible
Personne responsable: non disponible

R�sultats de recherche pour Optimal Scheduling with Nested Time Intervals and Three-Dime...

Image fournie par le vendeur

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

Thomas Rieger

Edit� par Cuvillier Jul 2015, 2015

ISBN 10 : 3736990359 ISBN 13 : 9783736990357

Neuf Taschenbuch

impression � la demande

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 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. 164 pp. Englisch. N� de r�f. du vendeur 9783736990357

Contacter le vendeur

Acheter neuf

EUR 37,80

Exp�dition �EUR 23
Exp�dition depuis Allemagne vers Etats-Unis

Quantit� disponible : 2 disponible(s)

Ajouter au panier

Image fournie par le vendeur

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

Rieger, Thomas

Edit� par Cuvillier Verlag, 2015

ISBN 10 : 3736990359 ISBN 13 : 9783736990357

Neuf Couverture souple

Vendeur : moluna, Greven, Allemagne

�valuation du vendeur 4 sur 5 �toiles

Etat : New. N� de r�f. du vendeur 117181631

Contacter le vendeur

Acheter neuf

EUR 37,80

Exp�dition �EUR 48,99
Exp�dition depuis Allemagne vers Etats-Unis

Quantit� disponible : Plus de 20 disponibles

Ajouter au panier

Image fournie par le vendeur

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

Thomas Rieger

Edit� par Cuvillier, Cuvillier Jul 2015, 2015

ISBN 10 : 3736990359 ISBN 13 : 9783736990357

Neuf Taschenbuch

Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne

�valuation du vendeur 5 sur 5 �toiles

Taschenbuch. Etat : Neu. Neuware -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.Cuvillier Verlag, Nonnenstieg 8, 37075 G�ttingen 164 pp. Englisch. N� de r�f. du vendeur 9783736990357

Contacter le vendeur

Acheter neuf

EUR 37,80

Exp�dition �EUR 60
Exp�dition depuis Allemagne vers Etats-Unis

Quantit� disponible : 2 disponible(s)

Ajouter au panier

Image fournie par le vendeur

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

Thomas Rieger

Edit� par Cuvillier, 2015

ISBN 10 : 3736990359 ISBN 13 : 9783736990357

Neuf Taschenbuch

impression � la demande

Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne

�valuation du vendeur 5 sur 5 �toiles

Taschenbuch. Etat : Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - 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. N� de r�f. du vendeur 9783736990357

Contacter le vendeur