Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
395133 | Information Sciences | 2008 | 12 Pages |
Abstract
In this paper we introduce 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. We show that the single-machine problems to minimize makespan and total completion time are polynomially solvable. In addition, we show that the problems to minimize total weighted completion time and maximum lateness are polynomially solvable under certain agreeable conditions. Finally, we present polynomial-time optimal solutions for some special cases of the m-machine flowshop problems to minimize makespan and total completion time.
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
Authors
T.C. Edwin Cheng, Chin-Chia Wu, Wen-Chiung Lee,