Two machine scheduling subject to arbitrary machine availability constraint

Omega ◽  
2018 ◽  
Vol 76 ◽  
pp. 128-136 ◽  
Author(s):  
Yumei Huo ◽  
Hairong Zhao
Keyword(s):  
Machine Scheduling ◽  
Availability Constraint ◽  
Machine Availability

Single Machine Scheduling with an Availability Constraint and Rejection

2014 ◽  
Vol 31 (05) ◽  
pp. 1450037 ◽  
Author(s):  
Chuanli Zhao ◽  
Hengyong Tang
Keyword(s):  
Single Machine ◽  
Approximation Scheme ◽  
Dynamic Programming Algorithm ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Programming Algorithm ◽  
Time Interval ◽  
Availability Constraint ◽  
Np Hard Problem ◽  
Rejection Penalty

This paper considers single machine scheduling with an availability constraint and rejection. It is assumed that the machine is not available for processing during a given time interval. A job is either rejected, in which case a rejection penalty has to be paid, or accepted and processed on the machine. The objective is to minimize the sum of the weighted total completion time of the accepted jobs and the total rejection penalty of the rejected jobs. For this NP-hard problem, we present a pseudo-polynomial dynamic programming algorithm and a fully polynomial-time approximation scheme (FPTAS).

Sign in / Sign up

Export Citation Format

Share Document