到达顾客时间总和最短的排序及运输

Machine Scheduling with Deliveries to Customers Location

生产和运输中的一个重要的问题是把生产和运输相结合.建立一台机器进行加工工件,并且把工件运送给不同目的地的多个顾客,目标函数是使到达顾客的时间最短.此问题在一般情况下是NP-难的.当顾客的数量是固定时,设计了动态规划算法,并对几种特殊情况设计了更有效的算法.

One important issue of production and logistics management is the coordination of activities between production and delivery.In this paper,we developed a single-machine scheduling model and carried the jobs to different destinations of multiple customers.The objective function is the shortest time to reach the customers.This issue is NP-hard in the general case. When the number of customers were fixed,we designed dynamic programming algorithm,and designed more efficient algorithm in several special situations.