Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/152
DC Field | Value | Language |
---|---|---|
dc.contributor | Department of Logistics and Maritime Studies | - |
dc.creator | Cheng, TCE | - |
dc.creator | Wu, CC | - |
dc.creator | Lee, WC | - |
dc.date.accessioned | 2014-12-11T08:23:02Z | - |
dc.date.available | 2014-12-11T08:23:02Z | - |
dc.identifier.issn | 0020-0255 | - |
dc.identifier.uri | http://hdl.handle.net/10397/152 | - |
dc.language.iso | en | en_US |
dc.publisher | Elsevier | en_US |
dc.rights | Information Sciences © 2008 Elsevier Science Ltd. The journal web site is located at http://www.sciencedirect.com | en_US |
dc.subject | Scheduling | en_US |
dc.subject | Learning effect | en_US |
dc.subject | Single-machine | en_US |
dc.subject | Flowshop | en_US |
dc.title | Some scheduling problems with sum-of-processing-times-based and job-position-based learning effects | en_US |
dc.type | Journal/Magazine Article | en_US |
dc.identifier.spage | 2476 | - |
dc.identifier.epage | 2487 | - |
dc.identifier.volume | 178 | - |
dc.identifier.issue | 11 | - |
dc.identifier.doi | 10.1016/j.ins.2008.02.002 | - |
dcterms.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. | - |
dcterms.accessRights | open access | en_US |
dcterms.bibliographicCitation | Information sciences, June 2008, v. 178, no. 11, p.2476-2487 | - |
dcterms.isPartOf | Information sciences | - |
dcterms.issued | 2008-06-01 | - |
dc.identifier.isi | WOS:000255323300009 | - |
dc.identifier.scopus | 2-s2.0-40849111346 | - |
dc.identifier.eissn | 1872-6291 | - |
dc.identifier.rosgroupid | r36815 | - |
dc.description.ros | 2007-2008 > Academic research: refereed > Publication in refereed journal | - |
dc.description.oa | Accepted Manuscript | en_US |
dc.identifier.FolderNumber | OA_IR/PIRA | en_US |
dc.description.pubStatus | Published | en_US |
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
251
Last Week
2
2
Last month
Citations as of Apr 28, 2024
Downloads
401
Citations as of Apr 28, 2024
SCOPUSTM
Citations
148
Last Week
0
0
Last month
1
1
Citations as of Apr 26, 2024
WEB OF SCIENCETM
Citations
144
Last Week
0
0
Last month
0
0
Citations as of May 2, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.