Verwandte Artikel zu Time-Dependent Path Scheduling: Algorithmic Minimization...

Time-Dependent Path Scheduling: Algorithmic Minimization of Walking Time at the Moving Assembly Line - Softcover

 
9783658284145: Time-Dependent Path Scheduling: Algorithmic Minimization of Walking Time at the Moving Assembly Line

Inhaltsangabe

Moving assembly lines are the stepping stone for mass production of automobiles. Here, every second counts, which necessitates planners to meticulously optimize them. A crucial factor is each worker’s nonproductive walking time between the moving workpiece and line-side material containers for picking up required material. Minimizing the walking time is difficult because the workpiece moves steadily. Helmut A. Sedding devises algorithms to optimize the sequence of work operations, and the placement of material containers. Thereby, he introduces a novel category of time-dependent scheduling problems, and lays the basis for the algorithmic optimization of time-dependent paths at the moving assembly line.

About the Author:

Helmut A. Sedding passed his doctoral thesis with distinction at the Institute of Theoretical Computer Science at Ulm University, Germany. He researches on modeling, complexity analysis, and algorithm design for the solution of various optimization problems. His practical experience includes the development of automotive production planning software in use at major car manufacturers.

Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.

Über die Autorin bzw. den Autor

Helmut A. Sedding passed his doctoral thesis with distinction at the Institute of Theoretical Computer Science at Ulm University, Germany. He researches on modeling, complexity analysis, and algorithm design for the solution of various optimization problems. His practical experience includes the development of automotive production planning software, in use at major car manufacturers.

Von der hinteren Coverseite

Moving assembly lines are the stepping stone for mass production of automobiles. Here, every second counts, which necessitates planners to meticulously optimize them. A crucial factor is each worker’s nonproductive walking time between the moving workpiece and line-side material containers for picking up required material. Minimizing the walking time is difficult because the workpiece moves steadily. Helmut A. Sedding devises algorithms to optimize the sequence of work operations, and the placement of material containers. Thereby, he introduces a novel category of time-dependent scheduling problems, and lays the basis for the algorithmic optimization of time-dependent paths at the moving assembly line.

Contents
  • Optimization Models for Minimizing Worker Walking Time Along Moving Assembly Lines
  • Complexity Analyses, Combinatorial Properties, and Optimization Algorithms 
  • Numerical Experiments and Statistical Analyses
Target Groups
  • Scientists in computer science, mathematics, operations research, operations management, and industrial engineering
  • Practitioners in the field of automobile production planning
About the Author
Helmut A. Sedding passed his doctoral thesis with distinction at the Institute of Theoretical Computer Science at Ulm University, Germany. He researches on modeling, complexity analysis, and algorithm design for the solution of various optimization problems. His practical experience includes the development of automotive production planning software in use at major car manufacturers.

„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.

EUR 13,71 für den Versand von Vereinigtes Königreich nach USA

Versandziele, Kosten & Dauer

Suchergebnisse für Time-Dependent Path Scheduling: Algorithmic Minimization...

Beispielbild für diese ISBN

Sedding, Helmut A.
Verlag: Springer Vieweg, 2019
ISBN 10: 3658284145 ISBN 13: 9783658284145
Neu Softcover

Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich

Verkäuferbewertung 5 von 5 Sternen 5 Sterne, Erfahren Sie mehr über Verkäufer-Bewertungen

Zustand: New. In. Artikel-Nr. ria9783658284145_new

Verkäufer kontaktieren

Neu kaufen

EUR 57,92
Währung umrechnen
Versand: EUR 13,71
Von Vereinigtes Königreich nach USA
Versandziele, Kosten & Dauer

Anzahl: Mehr als 20 verfügbar

In den Warenkorb

Beispielbild für diese ISBN

Sedding, Helmut A.
Verlag: Vieweg + Teubner Verlag, 2019
ISBN 10: 3658284145 ISBN 13: 9783658284145
Neu Paperback

Anbieter: Revaluation Books, Exeter, Vereinigtes Königreich

Verkäuferbewertung 5 von 5 Sternen 5 Sterne, Erfahren Sie mehr über Verkäufer-Bewertungen

Paperback. Zustand: Brand New. 168 pages. 8.00x5.75x0.50 inches. In Stock. Artikel-Nr. x-3658284145

Verkäufer kontaktieren

Neu kaufen

EUR 75,40
Währung umrechnen
Versand: EUR 28,62
Von Vereinigtes Königreich nach USA
Versandziele, Kosten & Dauer

Anzahl: 2 verfügbar

In den Warenkorb

Foto des Verkäufers

Helmut A. Sedding
ISBN 10: 3658284145 ISBN 13: 9783658284145
Neu Taschenbuch

Anbieter: buchversandmimpf2000, Emtmannsberg, BAYE, Deutschland

Verkäuferbewertung 5 von 5 Sternen 5 Sterne, Erfahren Sie mehr über Verkäufer-Bewertungen

Taschenbuch. Zustand: Neu. Neuware -Moving assembly lines are the stepping stone for mass production of automobiles. Here, every second counts, which necessitates planners to meticulously optimize them. A crucial factor is each worker¿s nonproductive walking time between the moving workpiece and line-side material containers for picking up required material. Minimizing the walking time is difficult because the workpiece moves steadily. Helmut A. Sedding devises algorithms to optimize the sequence of work operations, and the placement of material containers. Thereby, he introduces a novel category of time-dependent scheduling problems, and lays the basis for the algorithmic optimization of time-dependent paths at the moving assembly line.About the Author:Helmut A. Sedding passed his doctoral thesis with distinction at the Institute of Theoretical Computer Science at Ulm University, Germany. He researches on modeling, complexity analysis, and algorithm design for the solution of various optimization problems. His practical experience includes the development of automotive production planning software in use at major car manufacturers.Springer Vieweg in Springer Science + Business Media, Abraham-Lincoln-Straße 46, 65189 Wiesbaden 196 pp. Englisch. Artikel-Nr. 9783658284145

Verkäufer kontaktieren

Neu kaufen

EUR 53,49
Währung umrechnen
Versand: EUR 60,00
Von Deutschland nach USA
Versandziele, Kosten & Dauer

Anzahl: 2 verfügbar

In den Warenkorb

Foto des Verkäufers

Helmut A. Sedding
ISBN 10: 3658284145 ISBN 13: 9783658284145
Neu Taschenbuch

Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland

Verkäuferbewertung 5 von 5 Sternen 5 Sterne, Erfahren Sie mehr über Verkäufer-Bewertungen

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - Moving assembly lines are the stepping stone for mass production of automobiles. Here, every second counts, which necessitates planners to meticulously optimize them. A crucial factor is each worker's nonproductive walking time between the moving workpiece and line-side material containers for picking up required material. Minimizing the walking time is difficult because the workpiece moves steadily. Helmut A. Sedding devises algorithms to optimize the sequence of work operations, and the placement of material containers. Thereby, he introduces a novel category of time-dependent scheduling problems, and lays the basis for the algorithmic optimization of time-dependent paths at the moving assembly line.About the Author:Helmut A. Sedding passed his doctoral thesis with distinction at the Institute of Theoretical Computer Science at Ulm University, Germany. He researches on modeling, complexity analysis, and algorithm design for the solution of various optimization problems. His practical experience includes the development of automotive production planning software in use at major car manufacturers. Artikel-Nr. 9783658284145

Verkäufer kontaktieren

Neu kaufen

EUR 53,49
Währung umrechnen
Versand: EUR 61,31
Von Deutschland nach USA
Versandziele, Kosten & Dauer

Anzahl: 1 verfügbar

In den Warenkorb