國立虎尾科技大學 |

Time-Dependent Path Scheduling = Algorithmic Minimization of Walking Time at the Moving Assembly Line /

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Time-Dependent Path Scheduling/ by Helmut A. Sedding.
Reminder of title:	Algorithmic Minimization of Walking Time at the Moving Assembly Line /
Author:	Sedding, Helmut A.
Description:	XXIII, 169 p. 20 illus., 3 illus. in color.online resource. :
Contained By:	Springer Nature eBook
Subject:	Algorithms. -
Online resource:	https://doi.org/10.1007/978-3-658-28415-2
ISBN:	9783658284152

Time-Dependent Path Scheduling = Algorithmic Minimization of Walking Time at the Moving Assembly Line /
Sedding, Helmut A.

Time-Dependent Path SchedulingAlgorithmic Minimization of Walking Time at the Moving Assembly Line /[electronic resource] :by Helmut A. Sedding. - 1st ed. 2020. - XXIII, 169 p. 20 illus., 3 illus. in color.online resource.

Optimization Models for Minimizing Worker Walking Time Along Moving Assembly Lines -- Complexity Analyses, Combinatorial Properties, and Optimization Algorithms -- Numerical Experiments and Statistical Analyses.

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.

ISBN: 9783658284152

Standard No.: 10.1007/978-3-658-28415-2doiSubjects--Topical Terms:

527865
Algorithms.

LC Class. No.: QA76.9.A43

Dewey Class. No.: 005.1

Time-Dependent Path Scheduling = Algorithmic Minimization of Walking Time at the Moving Assembly Line /
LDR:03088nam a22003855i 4500 001 1025556
003 DE-He213
005 20200630152833.0
007 cr nn 008mamaa
008 210318s2020 gw | s |||| 0|eng d
020 $a 9783658284152 $9 978-3-658-28415-2
024 7 $a 10.1007/978-3-658-28415-2 $2 doi
035 $a 978-3-658-28415-2
050 4 $a QA76.9.A43
072 7 $a UMB $2 bicssc
072 7 $a COM051300 $2 bisacsh
072 7 $a UMB $2 thema
082 0 4 $a 005.1 $2 23
100 1 $a Sedding, Helmut A. $e author. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1321836
245 1 0 $a Time-Dependent Path Scheduling $h [electronic resource] : $b Algorithmic Minimization of Walking Time at the Moving Assembly Line / $c by Helmut A. Sedding.
250 $a 1st ed. 2020.
264 1 $a Wiesbaden : $b Springer Fachmedien Wiesbaden : $b Imprint: Springer Vieweg, $c 2020.
300 $a XXIII, 169 p. 20 illus., 3 illus. in color. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
505 0 $a Optimization Models for Minimizing Worker Walking Time Along Moving Assembly Lines -- Complexity Analyses, Combinatorial Properties, and Optimization Algorithms -- Numerical Experiments and Statistical Analyses.
520 $a 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.
650 0 $a Algorithms. $3 527865
650 0 $a Operations research. $3 573517
650 0 $a Management science. $3 719678
650 0 $a Industrial engineering. $3 679492
650 0 $a Production engineering. $3 566269
650 1 4 $a Algorithm Analysis and Problem Complexity. $3 593923
650 2 4 $a Operations Research, Management Science. $3 785065
650 2 4 $a Industrial and Production Engineering. $3 593943
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783658284145
776 0 8 $i Printed edition: $z 9783658284169
856 4 0 $u https://doi.org/10.1007/978-3-658-28415-2
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)