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.

Unrelated Parallel-Machine Scheduling with Controllable Processing Time

2013 ◽  
Vol 321-324 ◽  
pp. 1993-1998
Author(s):  
Chia Lun Hsu ◽  
Jin Shiuh Taur
Keyword(s):  
Completion Time ◽  
Processing Time ◽  
Parallel Machine Scheduling ◽  
Parallel Machine ◽  
Unrelated Parallel Machine ◽  
Absolute Deviation ◽  
Total Load ◽  
Unrelated Parallel Machine Scheduling ◽  
Controllable Processing Time ◽  
The Cost

This paper explores an unrelated parallel-machine resource allocation scheduling problem with controllable processing time. The objective is to minimize the cost function containing the weighted of total load, total completion time, total absolute deviation of completion time, and total compression cost. We show that the proposed problem is polynomial time solvable. We also discuss a special case of the problem and show that it can be optimally solved by lower order algorithm.

Sign in / Sign up

Export Citation Format

Share Document