Unrelated parallel-machine scheduling to minimize total weighted completion time

2013 ◽  
Vol 26 (6) ◽  
pp. 1099-1112 ◽  
Author(s):  
Jeng-Fung Chen
Keyword(s):  
Completion Time ◽  
Machine Scheduling ◽  
Parallel Machine Scheduling ◽  
Parallel Machine ◽  
Total Weighted Completion Time ◽  
Unrelated Parallel Machine ◽  
Unrelated Parallel Machine Scheduling ◽  
Weighted Completion Time

Unrelated Parallel-Machine Scheduling with Deteriorating Jobs and Rejection

2012 ◽  
Vol 263-266 ◽  
pp. 655-659 ◽  
Author(s):  
Chou Jung Hsu ◽  
Chia Wen Chang
Keyword(s):  
Completion Time ◽  
Deteriorating Jobs ◽  
Machine Scheduling ◽  
Parallel Machine Scheduling ◽  
Parallel Machine ◽  
Unrelated Parallel Machine ◽  
Absolute Deviation ◽  
Total Load ◽  
Unrelated Parallel Machine Scheduling ◽  
Total Penalty

This paper aimed to investigate the unrelated parallel-machine scheduling with deteriorating jobs and rejection. The objective is to find the rejected jobs, the non-rejected jobs, and the optimal non-rejected job sequence so that the cost function that includes the weighted of total load, total completion time, and total absolute deviation of completion time plus the total penalty of the rejected jobs would be minimized. Results showed that the problem is polynomial time solvable when the number of machine is fixed.

Sign in / Sign up

Export Citation Format

Share Document