Dr. Helmut Sedding

Position at the ZHAW

Senior Researcher

Group Operations Research & Operations Management
Institute of Data Analysis and Process Design (IDP)
School of Engineering

https://www.zhaw.ch/idp

Expertise and research interests

Combinatorial optimization algorithms, in particular in scheduling

Professional milestones

IISE Transactions Award 2021
Dr. rer. nat. (summa cum laude) 2019
IWA Prize 2016

Shared Awards:
Handling Award 2019 of the technical journal Handling in "Warehousing, Order Picking and Intralogistics"
German Assembly Congress 2019: first runner-up in the award for "Best Assembly Idea"
bwcon 2014: first runner-up CyberOne award
LogiMat 2013 Best Product Award in "Software, Communication, IT"

• Self-Regulated Corrective Actions on GFRP Production Process / Team member / Project ongoing
• Adaptive Production Planning Systems for Fast Decision Support / Deputy project leader / Project completed

• Sedding, Helmut A.,

  2020.

  Scheduling jobs with a V-shaped time-dependent processing time.

  Journal of Scheduling.

  23(6), pp. 751-768.

  Available from: https://doi.org/10.1007/s10951-020-00665-4

• Sedding, Helmut A.,

  2020.

  Line side placement for shorter assembly line worker paths.

  IISE Transactions.

  52(2), pp. 181-198.

  Available from: https://doi.org/10.1080/24725854.2018.1508929

• Jaehn, Florian; Sedding, Helmut,

  2016.

  Scheduling with time-dependent discrepancy times.

  Journal of Scheduling.

  19(6), pp. 737-757.

  Available from: https://doi.org/10.1007/s10951-016-0472-2

• Sedding, Helmut A.,

  2020.

  Time-dependent path scheduling : algorithmic minimization of walking time at the moving assembly line.

  Wiesbaden:

  Springer.

  ISBN 978-3-658-28414-5.

  Available from: https://doi.org/10.1007/978-3-658-28415-2

• Sedding, Helmut,

  2021.

  A lower bound for sequentially placing boxes at the moving assembly line to minimize walking time [paper].

  In:

  IWDSP 2021 : The Third International Workshop on Dynamic Scheduling Problems, Poznań (Poland), 5-7 July 2021.

• Sedding, Helmut,

  2021.

  An FPTAS for scheduling with piecewise-linear nonmonotonic convex time-dependent processing times and job-specific agreeable slopes [paper].

  In:

  Proceedings of the 17th International Workshop on Project Management and Scheduling.

  17th International Workshop on Project Management and Scheduling, Toulouse, 21-23 April 2021.

  EURO Working Group on Project Management and Scheduling.

  Available from: https://doi.org/10.21256/zhaw-22418

• Sedding, Helmut,

  2019.

  Scheduling with asymmetric piecewise-linear time-dependent processing times [paper].

  In:

  Proceedings of the 14th Workshop on Models and Algorithms for Planning and Scheduling Problems, MAPSP 2019.

  MAPSP 2019, Renesse, The Netherlands, 2-7 June 2019.

  Maastricht University.

  pp. 43-45.

• Sedding, Helmut,

  2021.

  IISE Transaction Award für Artikel zur algorithmischen Laufwege-Optimierung am Fliessband.

  ZHAW Industrie 4.0.

  Available from: https://blog.zhaw.ch/industrie4null/2021/06/01/iise-transaction-award-fuer-artikel-zur-algorithmischen-laufwege-optimierung-am-fliessband/

• Herrmann, Thomas; Sedding, Helmut,

  2019.

  Industrie 4.0 von morgen diskutiert.

  Technische Rundschau.

  111(10), pp. 74-75.

• Herrmann, Thomas; Sedding, Helmut,

  2019.

  Die Produktion von morgen.

  ZHAW Industrie 4.0.

  Available from: https://blog.zhaw.ch/industrie4null/2019/09/18/die-produktion-von-morgen/

• Sedding, Helmut,

  2019.

  Das digitale Produktions-Puzzle.

  Technische Rundschau.

  111(7), pp. 54-55.

  Available from: https://www.technische-rundschau.ch/archiv/2019/07/das-digitale-produktions-puzzle/

• Sedding, Helmut,

  2021.

  Line side placement for shorter assembly line worker paths.

  In:

  IISE Annual Virtual Conference & Expo 2021, 23-25 May 2021.

Scheduling non-monotonous convex piecewise-linear time-dependent processing times,
Proceedings of the 2nd International Workshop on Dynamic Scheduling Problems, 79–84, 2018.

On the complexity of scheduling start time dependent asymmetric convex processing times,
Proceedings of the 16th International Conference on Project Management and Scheduling, 209–212, 2018.

Scheduling of Time-Dependent Asymmetric Nonmonotonic Processing Times permits an FPTAS,
Proceedings of the 15th Cologne-Twente Workshop on Graphs & Combinatorial Optimization, 135–138, 2017.

Box Placement as Time Dependent Scheduling To Reduce Automotive Assembly Line Worker Walk Times,
Proceedings of the 13th Workshop on Models and Algorithms for Planning and Scheduling Problems, 92–94, 2017

Single Machine Scheduling with Nonmonotonic Piecewise Linear Time Dependent Processing Times, with F. Jaehn,
Proceedings of the 14th International Conference on Project Management and Scheduling 2014, 222–225, 2014

go back