東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Time-dependent path scheduling = alg...

Sedding, Helmut A.

FindBook

Google Book

Amazon

博客來

Time-dependent path scheduling = algorithmic minimization of walking time at the moving assembly line /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Time-dependent path scheduling/ by Helmut A. Sedding.
其他題名:	algorithmic minimization of walking time at the moving assembly line /
作者:	Sedding, Helmut A.
出版者:	Wiesbaden :Springer Fachmedien Wiesbaden : : 2020.,
面頁冊數:	xxiii, 169 p. :ill., digital ;24 cm.
內容註:	Optimization Models for Minimizing Worker Walking Time Along Moving Assembly Lines -- Complexity Analyses, Combinatorial Properties, and Optimization Algorithms -- Numerical Experiments and Statistical Analyses.
Contained By:	Springer eBooks
標題:	Production scheduling. -
電子資源:	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. - Wiesbaden :Springer Fachmedien Wiesbaden :2020. - xxiii, 169 p. :ill., digital ;24 cm.

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:

680857
Production scheduling.

LC Class. No.: TS157.5 / .S43 2020

Dewey Class. No.: 658.53

Time-dependent path scheduling = algorithmic minimization of walking time at the moving assembly line /
LDR:02765nmm a2200325 a 4500 001 2214516
003 DE-He213
005 20191122142144.0
006 m d
007 cr nn 008maaau
008 201118s2020 gw s 0 eng d
020 $a 9783658284152 $q (electronic bk.)
020 $a 9783658284145 $q (paper)
024 7 $a 10.1007/978-3-658-28415-2 $2 doi
035 $a 978-3-658-28415-2
040 $a GP $c GP
041 1 $a eng $b eng $b ger $h eng
050 4 $a TS157.5 $b .S43 2020
072 7 $a UMB $2 bicssc
072 7 $a COM051300 $2 bisacsh
072 7 $a UMB $2 thema
082 0 4 $a 658.53 $2 23
090 $a TS157.5 $b .S447 2020
100 1 $a Sedding, Helmut A. $3 3445125
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.
260 $a Wiesbaden : $b Springer Fachmedien Wiesbaden : $b Imprint: Springer Vieweg, $c 2020.
300 $a xxiii, 169 p. : $b ill., digital ; $c 24 cm.
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 Production scheduling. $3 680857
650 0 $a Assembly-line methods. $3 783763
650 1 4 $a Algorithm Analysis and Problem Complexity. $3 891007
650 2 4 $a Operations Research, Management Science. $3 1532996
650 2 4 $a Industrial and Production Engineering. $3 891024
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer eBooks
856 4 0 $u https://doi.org/10.1007/978-3-658-28415-2
950 $a Computer Science (Springer-11645)