Minimizing total tardiness and earliness on unrelated parallel machines with controllable processing times

2014 ◽  
Vol 41 ◽  
pp. 31-43 ◽  
Author(s):  
Vahid Kayvanfar ◽  
GH.M. Komaki ◽  
Amin Aalaei ◽  
M. Zandieh
Keyword(s):  
Parallel Machines ◽  
Total Tardiness ◽  
Controllable Processing Times ◽  
Unrelated Parallel Machines ◽  
Processing Times

scholarly journals Preemptive Scheduling with Controllable Processing Times on Parallel Machines

2015 ◽  
Vol 3 (1) ◽  
pp. 68-76
Author(s):  
Guiqing Liu ◽  
Kai Li ◽  
Bayi Cheng
Keyword(s):  
Polynomial Time ◽  
Resource Use ◽  
Parallel Machines ◽  
Optimal Algorithm ◽  
Parallel Machine Scheduling ◽  
Controllable Processing Times ◽  
Scheduling Problems ◽  
Processing Times ◽  
Online Problems ◽  
Machine Scheduling Problems

AbstractThis paper considers several parallel machine scheduling problems with controllable processing times, in which the goal is to minimize the makespan. Preemption is allowed. The processing times of the jobs can be compressed by some extra resources. Three resource use models are considered. If the jobs are released at the same time, the problems under all the three models can be solved in a polynomial time. The authors give the polynomial algorithm. When the jobs are not released at the same time, if all the resources are given at time zero, or the remaining resources in the front stages can be used to the next stages, the offline problems can be solved in a polynomial time, but the online problems have no optimal algorithm. If the jobs have different release dates, and the remaining resources in the front stages can not be used in the next stages, both the offline and online problems can be solved in a polynomial time.

Parallel-batching scheduling with nonlinear processing times on a single and unrelated parallel machines

2018 ◽  
Vol 78 (4) ◽  
pp. 693-715 ◽  
Author(s):  
Min Kong ◽  
Xinbao Liu ◽  
Jun Pei ◽  
Panos M. Pardalos ◽  
Nenad Mladenovic
Keyword(s):  
Parallel Machines ◽  
Unrelated Parallel Machines ◽  
Parallel Batching ◽  
Processing Times ◽  
Nonlinear Processing

Minimizing total tardiness on a single machine with controllable processing times

2009 ◽  
Vol 36 (6) ◽  
pp. 1852-1858 ◽  
Author(s):  
Chao-Tang Tseng ◽  
Ching-Jong Liao ◽  
Kuo-Ling Huang
Keyword(s):  
Single Machine ◽  
Total Tardiness ◽  
Controllable Processing Times ◽  
Processing Times
Sign in / Sign up

Export Citation Format

Share Document