Single Bounded Parallel-Batch Machine Scheduling with an Unavailability Constraint and Job Delivery

2020 ◽  
pp. 525-536 ◽  
Author(s):  
Jing Fan ◽  
C. T. Ng ◽  
T. C. E. Cheng ◽  
Hui Shi
Keyword(s):  
Machine Scheduling ◽  
Batch Machine ◽  
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

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

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$.

ON MINIMIZING TOTAL COMPLETION TIME IN BATCH MACHINE SCHEDULING

2004 ◽  
Vol 15 (04) ◽  
pp. 593-607 ◽  
Author(s):  
CHUNG KEUNG POON ◽  
WENCI YU
Keyword(s):  
Completion Time ◽  
Machine Scheduling ◽  
Total Completion Time ◽  
Scheduling Problem ◽  
Running Time ◽  
Batch Machine ◽  
Previous Time

We study the scheduling problem on a batch machine which is capable of processing a batch of jobs at a time. For a batch machine of capacity c, we designed an algorithm for minimizing the total completion time in O(n6c) time (for sufficiently large c). This improves the best previous time bound of O(nc(c-1)) given by Brucker et al [1]. We also designed a new algorithm with running time [Formula: see text].

Sign in / Sign up

Export Citation Format

Share Document