제조와 배치배송이 결합된 일정계획을 위한 VNS 알고리즘의 탐색효율에 관한 연구

Abstract

A design of neighborhood operations is a key factor on the performance of variable neighborhood search (VNS) algorithms. The various neighborhood operations in VNS algorithms could increase the algorithm effectiveness, but decrease the efficiency. To compare the performance of VNS algorithms with several designs of neighborhood operations, we consider a compound scheduling problem. The compound scheduling problem is to determine a set of jobs to be scheduled on integrating two-echelon supply chain between a manufacturing plant and customers delivered. The problem simultaneously determines machine scheduling, batching, and truck delivery scheduling in which jobs ordered by multi-customers are first manufactured by one of identical parallel machines and then they are delivered to the corresponding customers by multiple trucks with a limited capacity. The objective function on this problem is to minimize the total tardiness of the jobs. We propose employing different designs of neighborhood operations, and compare the performance of the designs through randomly generated problem instance examples.