Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/1083
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:24:03Z | - |
dc.date.available | 2014-12-11T08:24:03Z | - |
dc.identifier.issn | 0360-8352 | - |
dc.identifier.uri | http://hdl.handle.net/10397/1083 | - |
dc.language.iso | en | en_US |
dc.publisher | Pergamon Press | en_US |
dc.rights | Computers & Industrial Engineering © 2008 Elsevier 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 | Deteriorating jobs | en_US |
dc.subject | Single machine | en_US |
dc.subject | Flowshop | en_US |
dc.title | Some scheduling problems with deteriorating jobs and learning effects | en_US |
dc.type | Journal/Magazine Article | en_US |
dc.description.otherinformation | Author name used in this publication: T. C. E. Cheng | en_US |
dc.identifier.spage | 972 | - |
dc.identifier.epage | 982 | - |
dc.identifier.volume | 54 | - |
dc.identifier.issue | 4 | - |
dc.identifier.doi | 10.1016/j.cie.2007.11.006 | - |
dcterms.abstract | Although scheduling with deteriorating jobs and learning effect has been widely investigated, scheduling research has seldom considered the two phenomena simultaneously. However, job deterioration and learning co-exist in many realistic scheduling situations. In this paper, we introduce a new scheduling model in which both job deterioration and learning exist simultaneously. The actual processing time of a job depends not only on the processing times of the jobs already processed but also on its scheduled position. For the single-machine case, we derive polynomial-time optimal solutions for the problems to minimize makespan and total completion time. In addition, we show that the problems to minimize total weighted completion time and maximum lateness are polynomially solvable under certain agreeable conditions. For the case of an m-machine permutation flowshop, we present polynomial-time optimal solutions for some special cases of the problems to minimize makespan and total completion time. | - |
dcterms.accessRights | open access | en_US |
dcterms.bibliographicCitation | Computers and industrial engineering, May 2008, v. 54, no. 4, p. 972-982 | - |
dcterms.isPartOf | Computers and industrial engineering | - |
dcterms.issued | 2008-05 | - |
dc.identifier.isi | WOS:000255538000019 | - |
dc.identifier.scopus | 2-s2.0-41449089275 | - |
dc.identifier.eissn | 1879-0550 | - |
dc.identifier.rosgroupid | r39822 | - |
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 |
dc.description.oaCategory | Green (AAM) | en_US |
Appears in Collections: | Journal/Magazine Article |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
CAIE07317R1.pdf | Pre-published version | 155.61 kB | Adobe PDF | View/Open |
Page views
180
Last Week
0
0
Last month
Citations as of Oct 13, 2024
Downloads
294
Citations as of Oct 13, 2024
SCOPUSTM
Citations
124
Last Week
0
0
Last month
2
2
Citations as of Oct 17, 2024
WEB OF SCIENCETM
Citations
122
Last Week
0
0
Last month
0
0
Citations as of Oct 17, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.