文献类型：期刊文献

英文题名：An improved approximation algorithm for single machine scheduling with job delivery

作者：Liu, Peihai[1]; Lu, Xiwen[1]

机构：[1] Department of Mathematics, School of Science, East China University of Science and Technology, Shanghai 200237, China

年份：2011

卷号：412

期号：3

起止页码：270

外文期刊名：Theoretical Computer Science

收录：EI(收录号：20105213536117)

语种：英文

外文关键词：Machinery - Vehicles - Scheduling - Scheduling algorithms

摘要：In single machine scheduling with release times and job delivery, jobs are processed on a single machine and then delivered by a capacitated vehicle to a single customer. Only one vehicle is employed to deliver these jobs. The vehicle can deliver at most c jobs in a shipment. The delivery completion time of a job is defined as the time in which the delivery batch containing the job is delivered to the customer and the vehicle returns to the machine. The objective is to minimize the makespan, i.e., the maximum delivery completion time of the jobs. We provide an approximation algorithm for this problem which is better than that given in the literature, improving the performance ratio from 53 to 32. ? 2009 Elsevier B.V. All rights reserved.