Parallel machine scheduling problem to minimize the earliness/tardiness costs with learning effect and deteriorating jobs

2009 ◽  
Vol 21 (6) ◽  
pp. 843-851 ◽  
Author(s):  
M. Duran Toksarı ◽  
Ertan Güner
Keyword(s):  
Learning Effect ◽  
Deteriorating Jobs ◽  
Machine Scheduling ◽  
Parallel Machine Scheduling ◽  
Parallel Machine ◽  
Scheduling Problem ◽  
Parallel Machine Scheduling Problem

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