Wen-Chiung Lee

TL;DR: A new scheduling model with learning effects in which the actual processing time of a job is a function of the total normal processing times of the jobs already processed and of the job's scheduled position is introduced, showing that the single-machine problems to minimize makespan and total completion time are polynomially solvable.

TL;DR: A new scheduling model in which both job deterioration and learning exist simultaneously is introduced, and polynomial-time optimal solutions for some special cases of the problems to minimize makespan and total completion time are presented.

TL;DR: In this article, the learning effect is considered in a two-machine flow shop and several dominance properties and lower bounds are derived to speed up the elimination process of the branch-and-bound algorithm.

TL;DR: This paper extends models in which the actual job processing time not only depends on its scheduled position, but also depends on the sum of the processing times of jobs already processed and shows that the single-machine makespan and the total completion time problems remain polynomially solvable under the proposed model.

TL;DR: A new scheduling model is introduced in which job deterioration and learning, and setup times are considered simultaneously, and polynomial-time optimal solutions for some single-machine problems with or without the presence of certain conditions are derived.