Single-Machine Scheduling Problems with the General Sum-of-Processing-Time and Position-Dependent Effect Function
This paper considers the combination of the general sum-of-processing-time effect and position-dependent effect on a single machine. The actual processing time of a job is defined by functions of the sum of the normal processing times of the jobs processed and its position and control parameter in t...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2021-01-01
|
| Series: | Discrete Dynamics in Nature and Society |
| Online Access: | http://dx.doi.org/10.1155/2021/9236044 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | This paper considers the combination of the general sum-of-processing-time effect and position-dependent effect on a single machine. The actual processing time of a job is defined by functions of the sum of the normal processing times of the jobs processed and its position and control parameter in the sequence. We consider two monotonic effect functions: the nondecreasing function and the nonincreasing function. Our focus is the following objective functions, including the makespan, the sum of the completion time, the sum of the weighted completion time, and the maximum lateness. For the nonincreasing effect function, polynomial algorithm is presented for the makespan problem and the sum of completion time problem, respectively. The latter two objective functions can also be solved in polynomial time if the weight or due date and the normal processing time satisfy some agreeable relations. For the nondecreasing effect function, assume that the given parameter is zero. We also show that the makespan problem can remain polynomially solvable. For the sum of the total completion time problem and a1 is the deteriorating rate of the jobs, there exists an optimal solution for a1≥M; a V-shaped property with respect to the normal processing times is obtained for 0<a1≤1. Finally, we show that the sum of the weighted completion problem and the maximum lateness problem have polynomial-time solutions for a1>M under some agreeable conditions, respectively. |
|---|---|
| ISSN: | 1026-0226 1607-887X |