Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/152
Title: | Some scheduling problems with sum-of-processing-times-based and job-position-based learning effects | Authors: | Cheng, TCE Wu, CC Lee, WC |
Issue Date: | 1-Jun-2008 | Source: | 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. | Keywords: | Scheduling Learning effect Single-machine Flowshop |
Publisher: | Elsevier | Journal: | Information sciences | ISSN: | 0020-0255 | EISSN: | 1872-6291 | DOI: | 10.1016/j.ins.2008.02.002 | Rights: | Information Sciences © 2008 Elsevier Science Ltd. The journal web site is located at http://www.sciencedirect.com |
Appears in Collections: | Journal/Magazine Article |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
INS-D-07-724R1 Final Version.pdf | Pre-published version | 149 kB | Adobe PDF | View/Open |
Page views
247
Last Week
2
2
Last month
Citations as of Apr 21, 2024
Downloads
396
Citations as of Apr 21, 2024
SCOPUSTM
Citations
147
Last Week
0
0
Last month
1
1
Citations as of Apr 19, 2024
WEB OF SCIENCETM
Citations
143
Last Week
0
0
Last month
0
0
Citations as of Apr 25, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.