Scheduling with controllable release dates and processing times: Total completion time minimization

Abstract It is known that the single machine preemptive scheduling problem of minimizing total completion time with release date and deadline constraints is NP- hard. Du and Leung solved some special cases by the generalized Baker's algorithm and the generalized Smith's algorithm in O(n2) time. In this paper we give an O(n2) algorithm for the special case where the processing times and deadlines are agreeable. Moreover, for the case where the processing times and deadlines are disagreeable, we present two properties which could enable us to reduce the range of the enumeration algorithm

Download Full-text

On the single machine serial batching scheduling problem to minimize total completion time with precedence constraints, release dates and identical processing times

Operations Research Letters ◽

10.1016/s0167-6377(03)00007-5 ◽

2003 ◽

Vol 31 (4) ◽

pp. 323-326 ◽

Cited By ~ 15

Author(s):

C.T. Ng ◽

T.C.E. Cheng ◽

J.J. Yuan ◽

Z.H. Liu

Keyword(s):

Single Machine ◽

Completion Time ◽

Precedence Constraints ◽

Total Completion Time ◽

Release Dates ◽

Scheduling Problem ◽

Processing Times

Download Full-text

Scheduling Jobs with Decreasing Processing Times for the Total Completion Time Minimization

Operations Research Proceedings 2000 - Operations Research Proceedings ◽

10.1007/978-3-642-56656-1_56 ◽

2001 ◽

pp. 353-358

Author(s):

A. Bachman ◽

A. Janiak

Keyword(s):

Completion Time ◽

Total Completion Time ◽

Processing Times ◽

Time Minimization

Download Full-text

Enhanced lower bounds and exact procedures for total completion time minimization in a two‐machine permutation flowshop with release dates

International Transactions in Operational Research ◽

10.1111/itor.12421 ◽

2017 ◽

Vol 26 (6) ◽

pp. 2432-2449

Author(s):

Mehdi Mrad ◽

Sabrine Chalghoumi ◽

Talel Ladhari ◽

Anis Gharbi

Keyword(s):

Lower Bounds ◽

Completion Time ◽

Total Completion Time ◽

Release Dates ◽

Permutation Flowshop ◽

Time Minimization

Download Full-text

Scheduling Jobs with Truncated Exponential Sum-of-Logarithm-Processing-Times Based and Position-based Learning Effects

Asia Pacific Journal of Operational Research ◽

10.1142/s0217595915500268 ◽

2015 ◽

Vol 32 (04) ◽

pp. 1550026 ◽

Cited By ~ 6

Author(s):

Yuan-Yuan Lu ◽

Fei Teng ◽

Zhi-Xin Feng

Keyword(s):

Single Machine ◽

Minimization Problem ◽

Completion Time ◽

Heuristic Algorithms ◽

Exponential Sum ◽

Total Weighted Completion Time ◽

Learning Effects ◽

Processing Times ◽

Time Minimization ◽

Weighted Completion Time

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.

Download Full-text