Please use this identifier to cite or link to this item: http://localhost/handle/Hannan/628867
Title: Scheduling Semiconductor Wafer Fabrication Using a New Harmony Search Algorithm Based on Receipt Priority Interval
Authors: Long Zhang;Min Liu;Jinghua Hao;Xionghai Wang;Jun Dong
subject: DRLB|harmony search algorithm|receipt priority interval|dispatching rule based load balance|semiconductor wafer fabrication scheduling
Year: 2016
Publisher: IEEE
Abstract: For the scheduling problem of Semiconductor wafer fabrication (SWF), a new Dispatching rule based on the load balance (DRLB) is proposed. Further, a new Harmony search (HS) algorithm based receipt priority interval (HS_rpi) is presented to minimize the mean cycle time. A kind of chaotic sequence is used as the harmony vector. Then, a conversion method is designed to convert the real number harmony vector to the mixed vector representing the priorities of all receipts and the algorithm parameters. In order to increase the algorithm robustness and decrease the scale of the scheduling problem, based on receipt priority interval and DRLB, we give a special conversion method used to convert the above mixed vector to the solution of the scheduling problem of SWF. Computational simulations based on the practical instances validate the proposed algorithm.
URI: http://localhost/handle/Hannan/156191
http://localhost/handle/Hannan/628867
ISSN: 1022-4653
2075-5597
volume: 25
issue: 5
Appears in Collections:2016

Files in This Item:
File Description SizeFormat 
7570477.pdf351.37 kBAdobe PDFThumbnail
Preview File
Title: Scheduling Semiconductor Wafer Fabrication Using a New Harmony Search Algorithm Based on Receipt Priority Interval
Authors: Long Zhang;Min Liu;Jinghua Hao;Xionghai Wang;Jun Dong
subject: DRLB|harmony search algorithm|receipt priority interval|dispatching rule based load balance|semiconductor wafer fabrication scheduling
Year: 2016
Publisher: IEEE
Abstract: For the scheduling problem of Semiconductor wafer fabrication (SWF), a new Dispatching rule based on the load balance (DRLB) is proposed. Further, a new Harmony search (HS) algorithm based receipt priority interval (HS_rpi) is presented to minimize the mean cycle time. A kind of chaotic sequence is used as the harmony vector. Then, a conversion method is designed to convert the real number harmony vector to the mixed vector representing the priorities of all receipts and the algorithm parameters. In order to increase the algorithm robustness and decrease the scale of the scheduling problem, based on receipt priority interval and DRLB, we give a special conversion method used to convert the above mixed vector to the solution of the scheduling problem of SWF. Computational simulations based on the practical instances validate the proposed algorithm.
URI: http://localhost/handle/Hannan/156191
http://localhost/handle/Hannan/628867
ISSN: 1022-4653
2075-5597
volume: 25
issue: 5
Appears in Collections:2016

Files in This Item:
File Description SizeFormat 
7570477.pdf351.37 kBAdobe PDFThumbnail
Preview File
Title: Scheduling Semiconductor Wafer Fabrication Using a New Harmony Search Algorithm Based on Receipt Priority Interval
Authors: Long Zhang;Min Liu;Jinghua Hao;Xionghai Wang;Jun Dong
subject: DRLB|harmony search algorithm|receipt priority interval|dispatching rule based load balance|semiconductor wafer fabrication scheduling
Year: 2016
Publisher: IEEE
Abstract: For the scheduling problem of Semiconductor wafer fabrication (SWF), a new Dispatching rule based on the load balance (DRLB) is proposed. Further, a new Harmony search (HS) algorithm based receipt priority interval (HS_rpi) is presented to minimize the mean cycle time. A kind of chaotic sequence is used as the harmony vector. Then, a conversion method is designed to convert the real number harmony vector to the mixed vector representing the priorities of all receipts and the algorithm parameters. In order to increase the algorithm robustness and decrease the scale of the scheduling problem, based on receipt priority interval and DRLB, we give a special conversion method used to convert the above mixed vector to the solution of the scheduling problem of SWF. Computational simulations based on the practical instances validate the proposed algorithm.
URI: http://localhost/handle/Hannan/156191
http://localhost/handle/Hannan/628867
ISSN: 1022-4653
2075-5597
volume: 25
issue: 5
Appears in Collections:2016

Files in This Item:
File Description SizeFormat 
7570477.pdf351.37 kBAdobe PDFThumbnail
Preview File