Please use this identifier to cite or link to this item:
Title: Robust parallel machine scheduling problem with uncertainties and sequence-dependent setup time
Authors: Hu, H
Qin, Y
Issue Date: 2016
Publisher: Hindawi Publishing Corporation
Source: Scientific programming, 2016, v. 2016, 5127253 How to cite?
Journal: Scientific programming 
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.
ISSN: 1058-9244
EISSN: 1875-919X
DOI: 10.1155/2016/5127253
Appears in Collections:Journal/Magazine Article

View full-text via PolyU eLinks SFX Query
Show full item record

Page view(s)

Last Week
Last month
Checked on Aug 20, 2017

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.