Starting time minimization for the maximum job variant

2022 ◽  
Vol 307 ◽  
pp. 79-87
Author(s):  
Leah Epstein ◽  
Asaf Levin
2015 ◽  
Vol 32 (04) ◽  
pp. 1550026 ◽  
Author(s):  
Yuan-Yuan Lu ◽  
Fei Teng ◽  
Zhi-Xin Feng

In this study, we consider a scheduling problem with truncated exponential sum-of-logarithm-processing-times based and position-based learning effects on a single machine. We prove that the shortest processing time (SPT) rule is optimal for the makespan minimization problem, the sum of the θth power of job completion times minimization problem, and the total lateness minimization problem, respectively. For the total weighted completion time minimization problem, the discounted total weighted completion time minimization problem, the maximum lateness minimization problem, we present heuristic algorithms (the worst-case bound of these heuristic algorithms are also given) according to the corresponding single machine scheduling problems without learning considerations. It also shows that the problems of minimizing the total tardiness, the total weighted completion time and the discounted total weighted completion time are polynomially solvable under some agreeable conditions on the problem parameters.


2021 ◽  
Vol 70 (3) ◽  
pp. 2836-2849 ◽  
Author(s):  
Kaitao Meng ◽  
Deshi Li ◽  
Xiaofan He ◽  
Mingliu Liu
Keyword(s):  

2011 ◽  
Vol 2 (3) ◽  
pp. 113-117 ◽  
Author(s):  
M. Thorsell ◽  
S. Lyrenäs ◽  
E. Andolf ◽  
M. Kaijser

Sign in / Sign up

Export Citation Format

Share Document