Solving the two identical parallel machine problem with a single operator

2015 ◽  
Author(s):  
Pierre Baptiste ◽  
Djamal Rebaine ◽  
Mohammed Zouba
Keyword(s):  
Parallel Machine ◽  
Identical Parallel Machine ◽  
Single Operator ◽  
Parallel Machine Problem ◽  
Machine Problem

scholarly journals Parallel-Batch Scheduling with Two Models of Deterioration to Minimize the Makespan

2014 ◽  
Vol 2014 ◽  
pp. 1-10 ◽  
Author(s):  
Cuixia Miao
Keyword(s):  
Polynomial Time ◽  
Single Machine ◽  
Processing Time ◽  
Parallel Machine ◽  
Batch Scheduling ◽  
Approximation Schemes ◽  
Time Approximation ◽  
Identical Parallel Machine ◽  
Parallel Machine Problem ◽  
Machine Problem

We consider the bounded parallel-batch scheduling with two models of deterioration, in which the processing time of the first model ispj=aj+αtand of the second model ispj=a+αjt. The objective is to minimize the makespan. We presentO(n log n)time algorithms for the single-machine problems, respectively. And we propose fully polynomial time approximation schemes to solve the identical-parallel-machine problem and uniform-parallel-machine problem, respectively.

Sign in / Sign up

Export Citation Format

Share Document