Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/104564
| DC Field | Value | Language |
|---|---|---|
| dc.contributor | Department of Industrial and Systems Engineering | en_US |
| dc.creator | Lu, YY | en_US |
| dc.creator | Jin, J | en_US |
| dc.creator | Ji, P | en_US |
| dc.creator | Wang, JB | en_US |
| dc.date.accessioned | 2024-02-05T08:51:08Z | - |
| dc.date.available | 2024-02-05T08:51:08Z | - |
| dc.identifier.issn | 0941-0643 | en_US |
| dc.identifier.uri | http://hdl.handle.net/10397/104564 | - |
| dc.language.iso | en | en_US |
| dc.publisher | Springer UK | en_US |
| dc.rights | © The Natural Computing Applications Forum 2015 | en_US |
| dc.rights | This version of the article has been accepted for publication, after peer review (when applicable) and is subject to Springer Nature’s AM terms of use (https://www.springernature.com/gp/open-research/policies/accepted-manuscript-terms), but is not the Version of Record and does not reflect post-acceptance improvements, or any corrections. The Version of Record is available online at: http://dx.doi.org/10.1007/s00521-015-1993-x. | en_US |
| dc.subject | Deteriorating jobs | en_US |
| dc.subject | Learning effect | en_US |
| dc.subject | Parallel machine | en_US |
| dc.subject | Resource allocation | en_US |
| dc.subject | Scheduling | en_US |
| dc.title | Resource-dependent scheduling with deteriorating jobs and learning effects on unrelated parallel machine | en_US |
| dc.type | Journal/Magazine Article | en_US |
| dc.identifier.spage | 1993 | en_US |
| dc.identifier.epage | 2000 | en_US |
| dc.identifier.volume | 27 | en_US |
| dc.identifier.issue | 7 | en_US |
| dc.identifier.doi | 10.1007/s00521-015-1993-x | en_US |
| dcterms.abstract | The focus of this paper is to analyze unrelated parallel-machine resource allocation scheduling problem with learning effect and deteriorating jobs. The goal is to find the optimal sequence of jobs and the optimal resource allocation separately for minimizing the cost function including the total load, the total completion time, the total absolute deviation of completion time and the total resource cost. We show that the problem is polynomial time solvable if the number of machines is a given constant. | en_US |
| dcterms.accessRights | open access | en_US |
| dcterms.bibliographicCitation | Neural computing and applications, Oct. 2016, v. 27, no. 7, p. 1993-2000 | en_US |
| dcterms.isPartOf | Neural computing and applications | en_US |
| dcterms.issued | 2016-10 | - |
| dc.identifier.scopus | 2-s2.0-84938099193 | - |
| dc.identifier.eissn | 1433-3058 | en_US |
| dc.description.validate | 202402 bcch | en_US |
| dc.description.oa | Accepted Manuscript | en_US |
| dc.identifier.FolderNumber | ISE-0918 | - |
| dc.description.fundingSource | Others | en_US |
| dc.description.fundingText | The Scienc and echnology Development Project of Jilin Province of China; The Hong Kong Polytechnic University; the National Natural Science Foundation of China | en_US |
| dc.description.pubStatus | Published | en_US |
| dc.identifier.OPUS | 6566249 | - |
| dc.description.oaCategory | Green (AAM) | en_US |
| Appears in Collections: | Journal/Magazine Article | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Ji_Resource-Dependent_Scheduling_Deteriorating.pdf | Pre-Published version | 780.79 kB | Adobe PDF | View/Open |
Page views
109
Last Week
3
3
Last month
Citations as of Apr 12, 2026
Downloads
86
Citations as of Apr 12, 2026
SCOPUSTM
Citations
23
Citations as of May 8, 2026
WEB OF SCIENCETM
Citations
20
Citations as of Apr 23, 2026
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.



