Optimal Scheduling with Nested Time Intervals and Three-Dimensional Strip Packing on Compara-bility Graphs of an Arborescence Order - Softcover
Inhaltsangabe
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.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Suchergebnisse für Optimal Scheduling with Nested Time Intervals and Three-Dime...
Foto des Verkäufers
Optimal Scheduling with Nested Time Intervals and Three-Dimensional Strip Packing on Compara-bility Graphs of an Arborescence Order
Print-on-DemandAnbieter: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Taschenbuch. Zustand: 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. Bestandsnummer des Verkäufers 9783736990357
Neu kaufen
EUR 37,80
EUR 23,00 Versand
Versand von Deutschland nach USA
Versand von Deutschland nach USA
Anzahl: 2 verfügbar
Foto des Verkäufers
Optimal Scheduling with Nested Time Intervals and Three-Dimensional Strip Packing on Compara-bility Graphs of an Arborescence Order
Anbieter: moluna, Greven, Deutschland
Verkäuferbewertung 4 von 5 Sternen
Zustand: New. Bestandsnummer des Verkäufers 117181631
Neu kaufen
EUR 37,80
EUR 48,99 Versand
Versand von Deutschland nach USA
Versand von Deutschland nach USA
Anzahl: Mehr als 20 verfügbar
Foto des Verkäufers
Optimal Scheduling with Nested Time Intervals and Three-Dimensional Strip Packing on Compara-bility Graphs of an Arborescence Order
Verlag:
Cuvillier, Cuvillier Jul 2015, 2015
ISBN 10: 3736990359
ISBN 13: 9783736990357
Neu
Taschenbuch
Anbieter: buchversandmimpf2000, Emtmannsberg, BAYE, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Taschenbuch. Zustand: 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. Bestandsnummer des Verkäufers 9783736990357
Neu kaufen
EUR 37,80
EUR 60,00 Versand
Versand von Deutschland nach USA
Versand von Deutschland nach USA
Anzahl: 2 verfügbar
Foto des Verkäufers
Optimal Scheduling with Nested Time Intervals and Three-Dimensional Strip Packing on Compara-bility Graphs of an Arborescence Order
Print-on-DemandAnbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Taschenbuch. Zustand: 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. Bestandsnummer des Verkäufers 9783736990357
Neu kaufen
EUR 37,80
EUR 61,11 Versand
Versand von Deutschland nach USA
Versand von Deutschland nach USA
Anzahl: 1 verfügbar
Foto des Verkäufers
Optimal Scheduling with Nested Time Intervals and Three-Dimensional Strip Packing on Compara-bility Graphs of an Arborescence Order
Print-on-DemandAnbieter: preigu, Osnabrück, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Taschenbuch. Zustand: Neu. Optimal Scheduling with Nested Time Intervals and Three-Dimensional Strip Packing on Compara-bility Graphs of an Arborescence Order | Thomas Rieger | Taschenbuch | 164 S. | Englisch | 2015 | Cuvillier | EAN 9783736990357 | Verantwortliche Person für die EU: Cuvillier Verlag, Nonnenstieg 8, 37075 Göttingen, info[at]cuvillier[dot]de | Anbieter: preigu Print on Demand. Bestandsnummer des Verkäufers 104021106
Neu kaufen
EUR 37,80
EUR 70,00 Versand
Versand von Deutschland nach USA
Versand von Deutschland nach USA
Anzahl: 5 verfügbar