Heuristics for the identical machine scheduling problem with preventive maintenances

2015 ◽  
Vol 21 (1) ◽  
pp. 112-120
Author(s):  
Caili Jiang ◽  
Zhiqiang Lu ◽  
Weiwei Cui
Keyword(s):  
Machine Scheduling ◽  
Scheduling Problem ◽  
Identical Machine ◽  
Identical Machine Scheduling

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

Minimizing the number of tardy jobs in identical machine scheduling

1993 ◽  
Vol 25 (1-4) ◽  
pp. 243-246 ◽  
Author(s):  
Gürsel A. Süer ◽  
Eduardo Báez ◽  
Zbigniew Czajkiewicz
Keyword(s):  
Machine Scheduling ◽  
Number Of Tardy Jobs ◽  
Identical Machine ◽  
Tardy Jobs ◽  
Identical Machine Scheduling
Sign in / Sign up

Export Citation Format

Share Document