Machine scheduling with a maintenance interval and job delivery coordination

2015 ◽  
Vol 10 (8) ◽  
pp. 1645-1656 ◽  
Author(s):  
Jueliang Hu ◽  
Taibo Luo ◽  
Xiaotong Su ◽  
Jianming Dong ◽  
Weitian Tong ◽  
...  
Keyword(s):  
Machine Scheduling ◽  
Job Delivery

Parallel machine scheduling with job delivery coordination

2017 ◽  
Vol 58 ◽  
pp. 306
Author(s):  
Jianming Dong ◽  
Xueshi Wang ◽  
Liliang Wang ◽  
Jueliang Hu
Keyword(s):  
Machine Scheduling ◽  
Parallel Machine Scheduling ◽  
Parallel Machine ◽  
Job Delivery

Machine scheduling with job delivery coordination

2004 ◽  
Vol 158 (2) ◽  
pp. 470-487 ◽  
Author(s):  
Yung-Chia Chang ◽  
Chung-Yee Lee
Keyword(s):  
Machine Scheduling ◽  
Job Delivery

Machine Scheduling with a Maintenance Interval and Job Delivery Coordination

2015 ◽  
pp. 104-114
Author(s):  
Jueliang Hu ◽  
Taibo Luo ◽  
Xiaotong Su ◽  
Jianming Dong ◽  
Weitian Tong ◽  
...  
Keyword(s):  
Machine Scheduling ◽  
Job Delivery

Single machine scheduling with job delivery to multiple customers

2017 ◽  
Vol 21 (3) ◽  
pp. 337-348 ◽  
Author(s):  
Jianming Dong ◽  
Xueshi Wang ◽  
Jueliang Hu ◽  
Guohui Lin
Keyword(s):  
Single Machine ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Job Delivery

PARALLEL MACHINE SCHEDULING WITH JOB DELIVERY COORDINATION

2017 ◽  
Vol 58 (3-4) ◽  
pp. 306-313
Author(s):  
J. M. DONG ◽  
X. S. WANG ◽  
L. L. WANG ◽  
J. L. HU
Keyword(s):  
Parallel Machines ◽  
Machine Scheduling ◽  
Parallel Machine Scheduling ◽  
Parallel Machine ◽  
Performance Ratio ◽  
Worst Case ◽  
Identical Machine ◽  
Worst Case Performance Ratio ◽  
Job Delivery ◽  
Identical Machine Scheduling

We analyse a parallel (identical) machine scheduling problem with job delivery to a single customer. For this problem, each job needs to be processed on $m$ parallel machines non-pre-emptively and then transported to a customer by one vehicle with a limited physical capacity. The optimization goal is to minimize the makespan, the time at which all the jobs are processed and delivered and the vehicle returns to the machine. We present an approximation algorithm with a tight worst-case performance ratio of $7/3-1/m$ for the general case, $m\geq 3$.

A PTAS for single-machine scheduling with release dates and job delivery to minimize makespan

2019 ◽  
Vol 53 (4) ◽  
pp. 1261-1266 ◽  
Author(s):  
Lingfa Lu ◽  
Liqi Zhang
Keyword(s):  
Single Machine ◽  
Approximation Scheme ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Release Dates ◽  
Polynomial Time Approximation Scheme ◽  
Round Trip ◽  
Time Approximation ◽  
Job Delivery ◽  
Capacitated Vehicle

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.

scholarly journals A new heuristic algorithm for the machine scheduling problem with job delivery coordination

2009 ◽  
Vol 410 (27-29) ◽  
pp. 2581-2591 ◽  
Author(s):  
Chi-Shiang Su ◽  
Jason Chao-Hsien Pan ◽  
Tsung-Shin Hsu
Keyword(s):  
Heuristic Algorithm ◽  
Machine Scheduling ◽  
Scheduling Problem ◽  
Job Delivery
Sign in / Sign up

Export Citation Format

Share Document