We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Scheduling Jobs with Truncated Exponential Sum-of-Logarithm-Processing-Times Based and Position-based Learning Effects.
- Authors
Lu, Yuan-Yuan; Teng, Fei; Feng, Zhi-Xin
- Abstract
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.
- Subjects
PRODUCTION scheduling; LOGARITHMS; MACHINE learning; PROBLEM solving; HEURISTIC algorithms
- Publication
Asia-Pacific Journal of Operational Research, 2015, Vol 32, Issue 4, p-1
- ISSN
0217-5959
- Publication type
Article
- DOI
10.1142/S0217595915500268