Time dependent path scheduling algorithmic par sedding helmut (11 résultats)

Etat : New.

Etat : As New. Unread book in perfect condition.

Etat : New.

Etat : New.

Etat : New. pp. XXIII, 169 20 illus., 3 illus. in color. 1 Edition NO-PA16APR2015-KAP.

Etat : As New. Unread book in perfect condition.

Paperback. Etat : Brand New. 168 pages. 8.00x5.75x0.50 inches. In Stock.

Taschenbuch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.…

PF. Etat : New. This item is printed on demand. Brand new book, sourced directly from publisher. Dispatch time is 6-7 days from our warehouse. Book will be sent in robust, secure packaging to ensure it reaches you securely.

Etat : New. Print on Demand pp. XXIII, 169 20 illus., 3 illus. in color.

Etat : New. PRINT ON DEMAND pp. XXIII, 169 20 illus., 3 illus. in color.