A note on single-machine scheduling with general learning effect and past-sequence-dependent setup time

Abstract

a b s t r a c tIn this paper, we study a scheduling model with the consideration of both the learning effect and the setup time. Under the proposed model, the learning effect is a general function of the processing time of jobs already processed and its scheduled position, and the setup time is past-sequence-dependent. We then derive the optimal sequences for two single-machine problems, which are the makespan and the total completion time. Moreover, we showed that the weighted completion time, the maximum lateness, the maximum tardiness, and the total tardiness problems remain polynomially solvable under agreeable conditions.

Unrelated Parallel-Machine Scheduling Problems with General Truncated Job-Dependent Learning Effect

“…For some single machine and a two-machine flowshop scheduling problems, they presented the optimal solution respectively. Lee [4] considered single-machine scheduling jobs with general learning effect and past-sequence-dependent setup time. For some single machine scheduling problems, they presented the optimal solution respectively.…”

Single Machine Scheduling with General Learning Functions: Optimal Solutions

“…Wang ve Li, [24]; Yin vd. [25]; Lee, [26] ile Bai v.d., [27] geçmiş sıra bağımlı hazırlık zamanlı ve farklı öğrenme etkili durumda ele almışlar.…”

Some scheduling problems with sum of logarithm processing times based learning effect and exponential past sequence dependent delivery times

“…They also show that the total weighted completion time minimization problem and the maximum tardiness minimization problem can be solved in polynomial time under certain conditions. Lee [9] considered the learning effect and setup time, a scheduling model has been considered. It has been shown that the proposed model for two single machines can be solved in polynomial time for problems with objective function processing time, total completion time minimization.…”