Abstract.

During the automation of production scheduling, it is essential to optimize resources reallocation between different production sites (sources and consumers). Available data: set of resource consumers, consumption schedule (defining when and where each resource should be delivered), set of resource sources, delivery schedule, set of loaders (objects ensuring transportation of resources) with their respective parameters (speed, carrying capacity, bodyspace). The objective is to generate the optimal motion schedule for loaders. When generating the schedule, two conditions should be met: all resources should be delivered not later than when they are required, and total transportation effort of all loaders (tonnekilometres traveled) should be minimized.

Keywords:

production scheduling, logistics, delivery schedule.

PP. 68-77.

REFERENCES

1. Cormen, Thomas H.; Leiserson, Charles E.; Rivest, Ronald L.; Stein, Clifford (2009) [1990]. Introduction to Algorithms (3rd ed.). MIT Press and McGraw-Hill. ISBN 0-262-03384-4.
2. Mehlhorn, Kurt; Sanders, Peter (2008). Algorithms and Data Structures: The Basic Toolbox
3. Heger, Dominique A. (2004), "A Disquisition on The Performance Behavior of Binary Search Tree Data
Structures" European Journal for the Informatics Professional, 5 (5): 67–75
4. Gonnet, Gaston. "Optimal Binary Search Trees". Scientific Computation. ETH Zurich. December 2013.