A PTAS for single-machine scheduling with release dates and job delivery to minimize makespan
RAIRO - Operations Research - Recherche Opérationnelle, Tome 53 (2019) no. 4, pp. 1261-1266.

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.

Reçu le :
Accepté le :
DOI : 10.1051/ro/2018097
Classification : 90B35
Mots-clés : Scheduling, job delivery, polynomial-time approximation scheme
Lu, Lingfa 1 ; Zhang, Liqi 1

1 
@article{RO_2019__53_4_1261_0,
     author = {Lu, Lingfa and Zhang, Liqi},
     title = {A {PTAS} for single-machine scheduling with release dates and job delivery to minimize makespan},
     journal = {RAIRO - Operations Research - Recherche Op\'erationnelle},
     pages = {1261--1266},
     publisher = {EDP-Sciences},
     volume = {53},
     number = {4},
     year = {2019},
     doi = {10.1051/ro/2018097},
     mrnumber = {3989208},
     zbl = {1425.90049},
     language = {en},
     url = {http://www.numdam.org/articles/10.1051/ro/2018097/}
}
TY  - JOUR
AU  - Lu, Lingfa
AU  - Zhang, Liqi
TI  - A PTAS for single-machine scheduling with release dates and job delivery to minimize makespan
JO  - RAIRO - Operations Research - Recherche Opérationnelle
PY  - 2019
SP  - 1261
EP  - 1266
VL  - 53
IS  - 4
PB  - EDP-Sciences
UR  - http://www.numdam.org/articles/10.1051/ro/2018097/
DO  - 10.1051/ro/2018097
LA  - en
ID  - RO_2019__53_4_1261_0
ER  - 
%0 Journal Article
%A Lu, Lingfa
%A Zhang, Liqi
%T A PTAS for single-machine scheduling with release dates and job delivery to minimize makespan
%J RAIRO - Operations Research - Recherche Opérationnelle
%D 2019
%P 1261-1266
%V 53
%N 4
%I EDP-Sciences
%U http://www.numdam.org/articles/10.1051/ro/2018097/
%R 10.1051/ro/2018097
%G en
%F RO_2019__53_4_1261_0
Lu, Lingfa; Zhang, Liqi. A PTAS for single-machine scheduling with release dates and job delivery to minimize makespan. RAIRO - Operations Research - Recherche Opérationnelle, Tome 53 (2019) no. 4, pp. 1261-1266. doi : 10.1051/ro/2018097. http://www.numdam.org/articles/10.1051/ro/2018097/

Y.-C. Chang and C.-Y. Lee, Machine scheduling with job delivery coordination. Eur. J. Oper. Res. 158 (2004) 470–487. | DOI | MR | Zbl

B. Chen and C.-Y. Lee, Logistics scheduling with batching and transportation. Eur. J. Oper. Res. 189 (2008) 871–876. | DOI | MR | Zbl

Z.-L. Chen, Scheduling and common due date assignment with earliness-tardiness penalties and batch delivery costs. Eur. J. Oper. Res. 93 (1996) 49–60. | DOI | Zbl

Z.-L. Chen, Integrated production and outbound distribution scheduling: review and extensions. Oper. Res. 58 (2010) 130–148. | DOI | Zbl

Z.-L. Chen, G.L. Vairaktarakis, Integrated scheduling of production and distribution operations. Manage. Sci. 51 (2005) 614–628. | DOI | Zbl

N.G. Hall and C.N. Potts, Supply chain scheduling: batching and delivery. Oper. Res. 51 (2003) 566–584. | DOI | MR | Zbl

J.W. Herrmann and C.-Y. Lee, On scheduling to minimize earliness and batch delivery costs with a common due date. Eur. J. Oper. Res. 70 (1993) 272–288. | DOI | Zbl

Y. Ikura and M. Gimple, Efficient scheduling algorithms for a single batch processing machine. Oper. Res. Lett. 2 (1986) 61–65. | DOI | MR | Zbl

I. Kacem and H. Kellerer, Approximation algorithms for no idle time scheduling on a single machine with release times and delivery times. Discrete Appl. Math. 164 (2014) 154–160. | DOI | MR | Zbl

C.-Y. Lee and Z.-L. Chen, Machine scheduling with transportation considerations. J. Sched. 4 (2001) 3–24. | DOI | MR | Zbl

L.F. Lu, J.J. Yuan and L.Q. Zhang, The single machine scheduling with release dates and job delivery to minimize makespan. Theor. Comput. Sci. 393 (2008) 102–108. | DOI | MR | Zbl

P.H. Liu and X.W. Lu, An improved approximation algorithm for single machine scheduling with job delivery. Theor. Comput. Sci. 412 (2011) 270–274. | DOI | MR | Zbl

M. Mastrolilli, Efficient approximation schemes for scheduling problems with release dates and delivery times, J. Sched. 6 (2003) 521–531. | DOI | MR | Zbl

C.N. Potts, Analysis of a heuristic for one machine sequencing with release dates and delivery times, Oper. Res. 28 (1980) 1436–1441. | DOI | MR | Zbl

D.Y. Wang, O. Grunder and A.E. Moudni, Integrated scheduling of production and distribution operations: a review. Int. J. Ind. Syst. Eng. 19 (2015) 94–122.

H. Wang and C.-Y. Lee, Production and transport logistics scheduling with two transport mode choices. Nav. Res. Logist. 52 (2005) 796–809. | DOI | MR | Zbl

J.J. Yuan, A note on the complexity of single-machine scheduling with a common due date, earliness-tardiness, and batch delivery costs, Eur. J. Oper. Res. 94 (1996) 203–205. | DOI | Zbl

Cité par Sources :