Optimal Scheduling Nested Time by Rieger Thomas (5 results)
- Softcover
Seller: moluna, Greven, Germanymoluna
Contact seller5-star sellerCondition: New
US$ 44.43
US$ 55.91 shippingShips from Germany to U.S.A.Quantity: Over 20 available
Kartoniert / Broschiert. Condition: New.
- Softcover
- Print on Demand
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, GermanyBuchWeltWeit Ludwig Meier e.K.
Contact seller5-star sellerCondition: New
US$ 44.43
US$ 26.25 shippingShips from Germany to U.S.A.Quantity: 2 available
Taschenbuch. Condition: 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. Th…e 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.
- Softcover
- Print on Demand
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germanybuchversandmimpf2000
Contact seller5-star sellerCondition: New
US$ 44.43
US$ 68.48 shippingShips from Germany to U.S.A.Quantity: 1 available
Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. 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 sc…heduling 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.
- Softcover
- Print on Demand
Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH
Contact seller5-star sellerCondition: New
US$ 44.43
US$ 69.75 shippingShips from Germany to U.S.A.Quantity: 1 available
Taschenbuch. Condition: 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 sch…eduling 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.
- Softcover
- Print on Demand
Seller: preigu, Osnabrück, Germanypreigu
Contact seller5-star sellerCondition: New
US$ 44.43
US$ 79.89 shippingShips from Germany to U.S.A.Quantity: 5 available
Taschenbuch. Condition: 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ött…ingen, info[at]cuvillier[dot]de | Anbieter: preigu Print on Demand.
