The due date assignment scheduling problem with the deteriorating jobs and delivery time

Author(s):  
Jin Qian ◽  
Haiyan Han
2019 ◽  
Vol 75 ◽  
pp. 72-83 ◽  
Author(s):  
Hossein Khorrami Sarvestani ◽  
Alborz Zadeh ◽  
Majid Seyfi ◽  
Morteza Rasti-Barzoki

2013 ◽  
Vol 645 ◽  
pp. 280-284
Author(s):  
Hua Ping Wu ◽  
Min Huang ◽  
Vincent Cho ◽  
W.H. Ip ◽  
Xing Wei Wang

The paper considers the due-date assignment problem with a non-linear deterioration in which the due dates are determined by the equal slack method. Here, the processing time of a job is defined by a non-linear function of total normal processing time of jobs in front of it in the sequence. The objective is to minimize the total tardiness penalties. According to the needs from the real world, the problem is divided into two cases, i.e., allowing with early jobs and no early jobs respectively. The related lemma, corollary and theorems for the problems are proposed and proved. At the same time, it shows that the problems in this paper can be solved in the polynomial times.


Sign in / Sign up

Export Citation Format

Share Document