Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/1307
DC Field | Value | Language |
---|---|---|
dc.contributor | Department of Logistics and Maritime Studies | - |
dc.creator | Wang, JB | - |
dc.creator | Ng, CTD | - |
dc.creator | Cheng, TCE | - |
dc.creator | Liu, LL | - |
dc.date.accessioned | 2014-12-11T08:28:03Z | - |
dc.date.available | 2014-12-11T08:28:03Z | - |
dc.identifier.issn | 0925-5273 | - |
dc.identifier.uri | http://hdl.handle.net/10397/1307 | - |
dc.language.iso | en | en_US |
dc.publisher | Elsevier | en_US |
dc.rights | International Journal of Production Economics © 2007 Elsevier B.V. The journal web site is located at http://www.sciencedirect.com. | en_US |
dc.subject | Scheduling | en_US |
dc.subject | Single machine | en_US |
dc.subject | Learning effect | en_US |
dc.subject | Time-dependent | en_US |
dc.title | Single-machine scheduling with a time-dependent learning effect | en_US |
dc.type | Journal/Magazine Article | en_US |
dc.description.otherinformation | Author name used in this publication: J.-B. Wang | en_US |
dc.description.otherinformation | Author name used in this publication: C. T. Ng | en_US |
dc.description.otherinformation | Author name used in this publication: T. C. E. Cheng | en_US |
dc.identifier.spage | 802 | - |
dc.identifier.epage | 811 | - |
dc.identifier.volume | 111 | - |
dc.identifier.issue | 2 | - |
dc.identifier.doi | 10.1016/j.ijpe.2007.03.013 | - |
dcterms.abstract | In this paper we consider the single-machine scheduling problem with a time-dependent learning effect. The time-dependent learning effect of a job is assumed to be a function of the total normal processing time of the jobs scheduled in front of the job. We show by examples that the optimal schedule for the classical version of the problem is not optimal in the presence of a time-dependent learning effect for the following three objective functions: the weighted sum of completion times, the maximum lateness and the number of tardy jobs. But for some special cases, we prove that the weighted shortest processing time (WSPT) rule, the earliest due date (EDD) rule and Moore's Algorithm can construct an optimal schedule for the problem to minimize these objective functions, respectively. We use these three rules as heuristics for the general cases and analyze their worst-case error bounds. We also provide computational results to evaluate the performance of the heuristics. | - |
dcterms.accessRights | open access | en_US |
dcterms.bibliographicCitation | International journal of production economics, Feb. 2008, v. 111, no. 2, p. 802-811 | - |
dcterms.isPartOf | International journal of production economics | - |
dcterms.issued | 2008-02 | - |
dc.identifier.isi | WOS:000252981900046 | - |
dc.identifier.scopus | 2-s2.0-37349025024 | - |
dc.identifier.rosgroupid | r36114 | - |
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 | |
---|---|---|---|---|
Single-machine-time-dependent-Learning_1.pdf | Pre-published version | 157.86 kB | Adobe PDF | View/Open |
Page views
144
Last Week
1
1
Last month
Citations as of Apr 14, 2024
Downloads
387
Citations as of Apr 14, 2024
SCOPUSTM
Citations
90
Last Week
0
0
Last month
0
0
Citations as of Apr 19, 2024
WEB OF SCIENCETM
Citations
88
Last Week
0
0
Last month
1
1
Citations as of Apr 18, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.