Heuristic optimization of sequence of customer orders

摘要

Optimization of sequence of customer orders is studied. Each order contains several customer's requirements. The problem is to find such permutation of orders in production line that gives optimal for conveyor logistic properties. For solving this problem the heuristic is introduced. This heuristic uses combination of short and far seeing policies embedded in A* algorithm from artificial intelligence. The main merit of such algorithm is high rapidity, enabling effective optimization of long orders sequences in reasonable time.