Heuristic Cargo Assignment for Delivery Workload Balancing

抄録

An assignment problem of cargoes with manufacturing parts to interim storage lanes is addressed, which is a combinatorial optimization model of delivery workload balancing in an automobile assembly plant. The cargo assignment problem has previously been represented as a special case of the unrelated parallel machine scheduling problem of minimizing the makespan, and a heuristic algorithm based on linear partitioning has been presented. In this paper, a modified form of the special case of the unrelated parallel machine scheduling problem with a generalized objective function is considered, and the heuristic based on linear partitioning is extended to the modified form. Numerical experiments are conducted to examine the balancing performance of the extended heuristic algorithm, and the results are reported.