Time-Dependent Path Scheduling Algorithmic Minimization of Walki
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 workpiec
- PDF / 2,208,551 Bytes
- 177 Pages / 419.528 x 595.276 pts Page_size
- 106 Downloads / 192 Views
Time-Dependent Path Scheduling Algorithmic Minimization of Walking Time at the Moving Assembly Line
Time-Dependent Path Scheduling
Helmut A. Sedding
Time-Dependent Path Scheduling Algorithmic Minimization of Walking Time at the Moving Assembly Line
Helmut A. Sedding Institute of Theoretical Computer Science Ulm University Ulm, Germany Dissertation, Ulm University, Germany, 2019
ISBN 978-3-658-28414-5 ISBN 978-3-658-28415-2 (eBook) https://doi.org/10.1007/978-3-658-28415-2 Springer Vieweg © Springer Fachmedien Wiesbaden GmbH, part of Springer Nature 2020 This work is subject to copyright. All rights are reserved by the Publisher, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting, reproduction on microfilms or in any other physical way, and transmission or information storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology now known or hereafter developed. The use of general descriptive names, registered names, trademarks, service marks, etc. in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use. The publisher, the authors and the editors are safe to assume that the advice and information in this book are believed to be true and accurate at the date of publication. Neither the publisher nor the authors or the editors give a warranty, expressed or implied, with respect to the material contained herein or for any errors or omissions that may have been made. The publisher remains neutral with regard to jurisdictional claims in published maps and institutional affiliations. This Springer Vieweg imprint is published by the registered company Springer Fachmedien Wiesbaden GmbH part of Springer Nature. The registered company address is: Abraham-Lincoln-Str. 46, 65189 Wiesbaden, Germany
Acknowledgements
This monograph is my dissertation thesis in partial fulfillment of the doctoral degree of natural sciences at Ulm University, Germany. It was only possible to get to this point with the support of several other persons. I feel indebted to Prof. Dr. Uwe Schöning for generously offering the supervision of my dissertation and appointing me a doctoral position at the Institute of Theoretical Computer Science at Ulm University. I am highly grateful to Prof. Dr. Nils Boysen for his support and his review of my thesis. As well, I would like to warmly recognize Prof. Dr. Enno Ohlebusch for his effort to referee my thesis. For their committee membership, let me thank Prof. Dr. Birte Glimm, Prof. Dr.-Ing. Franz Hauck, and PD Dr. Friedhelm Schwenker. In addition, I especially thank Prof. Dr. Stanisław Gawiejnowicz for his invitation to Poznań and the valuable discussions about time-dependent scheduling. Let me further take the opportunity to thank the Initiative Wissenschaft und Automobilindustrie in Jena for awarding me their research
Data Loading...
