Artículos relacionados a Time-Dependent Path Scheduling: Algorithmic Minimization...
Time-Dependent Path Scheduling: Algorithmic Minimization of Walking Time at the Moving Assembly Line - Tapa blanda
Sinopsis
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.
"Sinopsis" puede pertenecer a otra edición de este libro.
Acerca del 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.
De la contraportada
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.
"Sobre este título" puede pertenecer a otra edición de este libro.
EUR 60,19
EUR 16,96 gastos de envío desde Estados Unidos de America a España
Destinos, gastos y plazos de envíoComprar nuevo
Ver este artículo
EUR 58,18
EUR 5,16 gastos de envío desde Reino Unido a España
Destinos, gastos y plazos de envíoResultados de la búsqueda para Time-Dependent Path Scheduling: Algorithmic Minimization...
Imagen de archivo
Time-Dependent Path Scheduling: Algorithmic Minimization of Walking Time at the Moving Assembly Line
Librería: Ria Christie Collections, Uxbridge, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Condición: New. In. Nº de ref. del artículo: ria9783658284145_new
Cantidad disponible: Más de 20 disponibles
Imagen del vendedor
Time-Dependent Path Scheduling
Publicado por
Springer Fachmedien Wiesbaden Dez 2019, 2019
ISBN 10: 3658284145
ISBN 13: 9783658284145
Nuevo
Taschenbuch
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - 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. 196 pp. Englisch. Nº de ref. del artículo: 9783658284145
Cantidad disponible: 2 disponibles
Imagen del vendedor
Time-Dependent Path Scheduling : Algorithmic Minimization of Walking Time at the Moving Assembly Line
Publicado por
Springer Fachmedien Wiesbaden, 2019
ISBN 10: 3658284145
ISBN 13: 9783658284145
Nuevo
Taschenbuch
Librería: AHA-BUCH GmbH, Einbeck, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: 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. Nº de ref. del artículo: 9783658284145
Cantidad disponible: 1 disponibles
Imagen del vendedor
Time-Dependent Path Scheduling
Publicado por
Springer Fachmedien Wiesbaden, 2019
ISBN 10: 3658284145
ISBN 13: 9783658284145
Nuevo
Tapa blanda
Librería: moluna, Greven, Alemania
Calificación del vendedor: 4 de 5 estrellas
Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Fast algorithms for computational decision supportHelmut 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,. Nº de ref. del artículo: 449124380
Cantidad disponible: Más de 20 disponibles
Imagen del vendedor
Time-Dependent Path Scheduling : Algorithmic Minimization of Walking Time at the Moving Assembly Line
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Condición: New. Nº de ref. del artículo: 38721260-n
Cantidad disponible: Más de 20 disponibles
Imagen de archivo
Time-Dependent Path Scheduling: Algorithmic Minimization of Walking Time at the Moving Assembly Line
Publicado por
Springer Vieweg 2020-01-27, 2020
ISBN 10: 3658284145
ISBN 13: 9783658284145
Nuevo
Paperback
Librería: Chiron Media, Wallingford, Reino Unido
Calificación del vendedor: 4 de 5 estrellas
Paperback. Condición: New. Nº de ref. del artículo: 6666-IUK-9783658284145
Cantidad disponible: 10 disponibles
Imagen de archivo
Time-Dependent Path Scheduling: Algorithmic Minimization of Walking Time at the Moving Assembly Line
Librería: Best Price, Torrance, CA, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Condición: New. SUPER FAST SHIPPING. Nº de ref. del artículo: 9783658284145
Cantidad disponible: 2 disponibles
Imagen del vendedor
Time-Dependent Path Scheduling : Algorithmic Minimization of Walking Time at the Moving Assembly Line
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Condición: New. Nº de ref. del artículo: 38721260-n
Cantidad disponible: Más de 20 disponibles
Imagen del vendedor
Time-Dependent Path Scheduling : Algorithmic Minimization of Walking Time at the Moving Assembly Line
Publicado por
Springer Vieweg, 2019
ISBN 10: 3658284145
ISBN 13: 9783658284145
Antiguo o usado
Tapa blanda
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Condición: As New. Unread book in perfect condition. Nº de ref. del artículo: 38721260
Cantidad disponible: Más de 20 disponibles
Imagen del vendedor
Time-Dependent Path Scheduling : Algorithmic Minimization of Walking Time at the Moving Assembly Line
Publicado por
Springer Vieweg, 2019
ISBN 10: 3658284145
ISBN 13: 9783658284145
Antiguo o usado
Tapa blanda
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Condición: As New. Unread book in perfect condition. Nº de ref. del artículo: 38721260
Cantidad disponible: Más de 20 disponibles