scholarly journals Parallel-machine scheduling of simple linear deteriorating jobs

2009 ◽  
Vol 410 (38-40) ◽  
pp. 3761-3768 ◽  
Author(s):  
Min Ji ◽  
T.C.E. Cheng
Keyword(s):  
Deteriorating Jobs ◽  
Machine Scheduling ◽  
Parallel Machine Scheduling ◽  
Parallel Machine

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.

An FPTAS for Uniform Parallel-Machine Scheduling Problem with Deteriorating Jobs and Rejection

2013 ◽  
Vol 433-435 ◽  
pp. 2335-2338
Author(s):  
Cheng Xin Luo
Keyword(s):  
Deteriorating Jobs ◽  
Nondecreasing Function ◽  
Machine Scheduling ◽  
Parallel Machine Scheduling ◽  
Parallel Machine ◽  
Scheduling Problem ◽  
Total Load ◽  
Penalty Cost ◽  
Parallel Machine Scheduling Problem ◽  
Uniform Parallel Machine Scheduling

This paper studies uniform parallel-machine scheduling problem with deteriorating jobs and rejection. The processing time of each job is a linear nondecreasing function of its starting time. A job can be rejected by paying a penalty cost. The objective is to minimize the sum of the total load of the accepted jobs on all machines and the total rejection penalties of the rejected jobs. We propose a fully polynomial-time approximation scheme (FPTAS) for this problem.

Sign in / Sign up

Export Citation Format

Share Document