Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/65712
DC Field | Value | Language |
---|---|---|
dc.contributor | Department of Industrial and Systems Engineering | - |
dc.creator | Hu, H | - |
dc.creator | Ng, KKH | - |
dc.creator | Qin, Y | - |
dc.date.accessioned | 2017-05-22T02:09:05Z | - |
dc.date.available | 2017-05-22T02:09:05Z | - |
dc.identifier.issn | 1058-9244 | en_US |
dc.identifier.uri | http://hdl.handle.net/10397/65712 | - |
dc.language.iso | en | en_US |
dc.publisher | Hindawi Publishing Corporation | en_US |
dc.rights | Copyright © 2016 Hongtao Hu et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. | en_US |
dc.rights | The following article: Hu, H., Ng, K. K. H., & Qin, Y. (2016). Robust parallel machine scheduling problem with uncertainties and sequence-dependent setup time. Scientific Programming, 2016, is available at https//doi.org/10.1155/2016/5127253 | en_US |
dc.title | Robust parallel machine scheduling problem with uncertainties and sequence-dependent setup time | en_US |
dc.type | Journal/Magazine Article | en_US |
dc.identifier.volume | 2016 | en_US |
dc.identifier.doi | 10.1155/2016/5127253 | en_US |
dcterms.abstract | A parallel machine scheduling problem in plastic production is studied in this paper. In this problem, the processing time and arrival time are uncertain but lie in their respective intervals. In addition, each job must be processed together with a mold while jobs which belong to one family can share the same mold. Therefore, time changing mold is required for two consecutive jobs that belong to different families, which is known as sequence-dependent setup time. This paper aims to identify a robust schedule by min-max regret criterion. It is proved that the scenario incurring maximal regret for each feasible solution lies in finite extreme scenarios. A mixed integer linear programming formulation and an exact algorithm are proposed to solve the problem. Moreover, a modified artificial bee colony algorithm is developed to solve large-scale problems. The performance of the presented algorithm is evaluated through extensive computational experiments and the results show that the proposed algorithm surpasses the exact method in terms of objective value and computational time. | - |
dcterms.accessRights | open access | - |
dcterms.bibliographicCitation | Scientific programming, 2016, v. 2016, 5127253 | - |
dcterms.isPartOf | Scientific programming | - |
dcterms.issued | 2016 | - |
dc.identifier.isi | WOS:000389366600001 | - |
dc.identifier.scopus | 2-s2.0-85006056292 | - |
dc.identifier.eissn | 1875-919X | en_US |
dc.identifier.artn | 5127253 | en_US |
dc.description.oa | Version of Record | - |
dc.identifier.FolderNumber | a0768-n01 | - |
dc.identifier.SubFormID | 1562 | - |
dc.description.fundingSource | RGC | - |
dc.description.fundingSource | Others | - |
dc.description.fundingText | RGC: 14YZ111,QD2015041 | - |
dc.description.fundingText | Others: RUF1,RU8H,71201099 | - |
dc.description.pubStatus | Published | - |
Appears in Collections: | Journal/Magazine Article |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Hu_Robust_Parallel_Machine.pdf | 1.65 MB | Adobe PDF | View/Open |
Page views
129
Last Week
1
1
Last month
Citations as of Apr 14, 2024
Downloads
147
Citations as of Apr 14, 2024
SCOPUSTM
Citations
33
Last Week
0
0
Last month
Citations as of Apr 12, 2024
WEB OF SCIENCETM
Citations
29
Last Week
0
0
Last month
Citations as of Apr 18, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.