logo

EbookBell.com

Most ebook files are in PDF format, so you can easily read them using various software such as Foxit Reader or directly on the Google Chrome browser.
Some ebook files are released by publishers in other formats such as .awz, .mobi, .epub, .fb2, etc. You may need to install specific software to read these formats on mobile/PC, such as Calibre.

Please read the tutorial at this link:  https://ebookbell.com/faq 


We offer FREE conversion to the popular formats you request; however, this may take some time. Therefore, right after payment, please email us, and we will try to provide the service as quickly as possible.


For some exceptional file formats or broken links (if any), please refrain from opening any disputes. Instead, email us first, and we will try to assist within a maximum of 6 hours.

EbookBell Team

Timedependent Path Scheduling Algorithmic Minimization Of Walking Time At The Moving Assembly Line 1st Ed 2020 Helmut A Sedding

  • SKU: BELL-10803840
Timedependent Path Scheduling Algorithmic Minimization Of Walking Time At The Moving Assembly Line 1st Ed 2020 Helmut A Sedding
$ 31.00 $ 45.00 (-31%)

0.0

0 reviews

Timedependent Path Scheduling Algorithmic Minimization Of Walking Time At The Moving Assembly Line 1st Ed 2020 Helmut A Sedding instant download after payment.

Publisher: Springer Fachmedien Wiesbaden;Springer Vieweg
File Extension: PDF
File size: 2.11 MB
Author: Helmut A. Sedding
ISBN: 9783658284145, 9783658284152, 3658284145, 3658284153
Language: English
Year: 2020
Edition: 1st ed. 2020

Product desciption

Timedependent Path Scheduling Algorithmic Minimization Of Walking Time At The Moving Assembly Line 1st Ed 2020 Helmut A Sedding by Helmut A. Sedding 9783658284145, 9783658284152, 3658284145, 3658284153 instant download after payment.

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.

Related Products