Single machine scheduling with exponential time-dependent learning effect and past-sequence-dependent setup times

✍ Scribed by Ji-Bo Wang; Dan Wang; Li-Yan Wang; Lin Lin; Na Yin; Wei-Wei Wang

• Publisher: Elsevier Science
• Year: 2009
• Tongue: English
• Weight: 472 KB
• Volume: 57
• Category: Article
• ISSN: 0898-1221
• DOI: 10.1016/j.camwa.2008.09.025

✦ Synopsis

In this paper we consider the single machine scheduling problem with exponential time-dependent learning effect and past-sequence-dependent (p-s-d) setup times. By the exponential time-dependent learning effect, we mean that the processing time of a job is defined by an exponent function of the total normal processing time of the already processed jobs. The setup times are proportional to the length of the already processed jobs. We consider the following objective functions: the makespan, the total completion time, the sum of the quadratic job completion times, the total weighted completion time and the maximum lateness. We show that the makespan minimization problem, the total completion time minimization problem and the sum of the quadratic job completion times minimization problem can be solved by the smallest (normal) processing time first (SPT) rule, respectively. We also show that the total weighted completion time minimization problem and the maximum lateness minimization problem can be solved in polynomial time under certain conditions.