• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Time-Dependent Path Scheduling: Algorithmic Minimization of Walking Time at the Moving Assembly Line

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

Paperback

Business GeneralTechnology & EngineeringProgramming

ISBN10: 3658284145
ISBN13: 9783658284145
Publisher: Springer Vieweg
Published: Dec 3 2019
Pages: 169
Weight: 0.53
Height: 0.42 Width: 5.83 Depth: 8.27
Language: English

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.

Also in

Programming