PolyU Institutional Repository >
Logistics and Maritime Studies >
LMS Journal/Magazine Articles >
Please use this identifier to cite or link to this item:
|Title: ||Some scheduling problems with sum-of-processing-times-based and job-position-based learning effects|
|Authors: ||Cheng, T. C. Edwin|
|Issue Date: ||1-Jun-2008 |
|Citation: ||Information sciences, June 2008, v. 178, no. 11, p.2476-2487.|
|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.|
|Rights: ||Information Sciences © 2008 Elsevier Science Ltd. The journal web site is located at http://www.sciencedirect.com|
|Type: ||Journal/Magazine Article|
|Appears in Collections:||LMS Journal/Magazine Articles|
Locate publisher version via
All items in the PolyU Institutional Repository are protected by copyright, with all rights reserved, unless otherwise indicated.
No item in the PolyU IR may be reproduced for commercial or resale purposes.