p.826
p.830
p.834
p.839
p.843
p.851
p.857
p.862
p.867
A Simulated Annealing to Solve Four-Stage Open Shops with Parallel Machines
Abstract:
This paper considers the scheduling problem of the four-stage open shop with parallel machines per stage observed in the chip sorting operation of light emitting diode (LED) testing. In this operation, each job (epiwafer) should be processed by the four working stages without predetermined processing route in order to separate specific LED grades. The considered problem is one of hard combinatorial optimization problems which have not been received much attention in the literature. Due to its computational complexity, in this study, two simulated annealing (SA) algorithms with different initial solutions are proposed to minimize total weighted completion times of jobs. A set of twenty benchmark solutions from a five-job problem is used to evaluate the performances of two SAs. Computational results reveal that the algorithms perform efficient and effective whatever the dimensions of problems are small or large.
Info:
Periodical:
Pages:
843-847
Citation:
Online since:
June 2013
Authors:
Price:
Сopyright:
© 2013 Trans Tech Publications Ltd. All Rights Reserved
Share:
Citation: