An improved approximation algorithm for single machine scheduling with job delivery

10Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

Abstract

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.

Cite

CITATION STYLE

APA

Liu, P., & Lu, X. (2011). An improved approximation algorithm for single machine scheduling with job delivery. In Theoretical Computer Science (Vol. 412, pp. 270–274). https://doi.org/10.1016/j.tcs.2010.09.025

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free