scholarly journals General parametric scheme for the online uniform machine scheduling problem with two different speeds

2018 ◽  
Vol 134 ◽  
pp. 18-23 ◽  
Author(s):  
Alexandre Dolgui ◽  
Vladimir Kotov ◽  
Aliaksandr Nekrashevich ◽  
Alain Quilliot
Keyword(s):  
Machine Scheduling ◽  
Scheduling Problem ◽  
Uniform Machine ◽  
Uniform Machine Scheduling

Uniform Machine Scheduling Problem with Deteriorating Jobs and Rejection

2013 ◽  
Vol 433-435 ◽  
pp. 2429-2432
Author(s):  
Sheng Hua Zhao ◽  
Cheng Xin Luo
Keyword(s):  
Approximation Scheme ◽  
Deteriorating Jobs ◽  
Nondecreasing Function ◽  
Machine Scheduling ◽  
Scheduling Problem ◽  
Penalty Cost ◽  
Uniform Machine ◽  
Starting Time ◽  
Uniform Machine Scheduling ◽  
Rejection Penalty

In this paper, we consider uniform machine scheduling problem with deteriorating jobs and rejection. Each job's processing time 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 makespan of the accepted jobs and the total rejection penalty of the rejected jobs. We propose a fully polynomial-time approximation scheme (FPTAS), which shows that the problem is NP-hard in the ordinary sense.

A linear compound algorithm for uniform machine scheduling

Computing ◽  
1998 ◽  
Vol 61 (1) ◽  
pp. 1-9 ◽  
Author(s):  
R. E. Burkard ◽  
Y. He ◽  
H. Kellerer
Keyword(s):  
Machine Scheduling ◽  
Uniform Machine ◽  
Uniform Machine Scheduling ◽  
Linear Compound
Sign in / Sign up

Export Citation Format

Share Document