Volume 53, Number 4, October 2019
|Page(s)||1261 - 1266|
|Published online||05 August 2019|
A PTAS for single-machine scheduling with release dates and job delivery to minimize makespan
School of Mathematics and Statistics, Zhengzhou University, 450001 Zhengzhou, Henan, PR China
2 College of Information and Management Science, Henan Agricultural University, 450003 Zhengzhou, Henan, PR China
* Corresponding author: email@example.com
Accepted: 28 October 2018
We consider the single-machine scheduling problem with release dates and job delivery to minimize makespan. Preemption is not allowed in the processing of the jobs. All jobs are first processed on a single machine and then delivered by a capacitated vehicle to a single customer. The vehicle can deliver at most c ≥ 1 jobs in each shipment. The round-trip transportation time between the machine and customer is a constant T > 0. The problem was proved to be strongly NP-hard and a 3/2-approximation algorithm was presented in the literature. In this paper we provide a polynomial-time approximation scheme (PTAS) for the problem.
Mathematics Subject Classification: 90B35
Key words: Scheduling / job delivery / polynomial-time approximation scheme
© EDP Sciences, ROADEF, SMAI 2019
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.