Please use this identifier to cite or link to this item:
|Title:||Metaheuristics for minimizing the makespan of the dynamic shop scheduling problem||Authors:||Liu, S.Q.
|Keywords:||Dynamic shop scheduling
|Issue Date:||Mar-2005||Citation:||Liu, S.Q., Ong, H.L., Ng, K.M. (2005-03). Metaheuristics for minimizing the makespan of the dynamic shop scheduling problem. Advances in Engineering Software 36 (3) : 199-205. ScholarBank@NUS Repository. https://doi.org/10.1016/j.advengsoft.2004.10.002||Abstract:||For the shop scheduling problems such as flow-shop, job-shop, open-shop, mixed-shop, and group-shop, most research focuses on optimizing the makespan under static conditions and does not take into consideration dynamic disturbances such as machine breakdown and new job arrivals. We regard the shop scheduling problem under static conditions as the static shop scheduling problem, while the shop scheduling problem with dynamic disturbances as the dynamic shop scheduling problem. In this paper, we analyze the characteristics of the dynamic shop scheduling problem when machine breakdown and new job arrivals occur, and present a framework to model the dynamic shop scheduling problem as a static group-shop-type scheduling problem. Using the proposed framework, we apply a metaheuristic proposed for solving the static shop scheduling problem to a number of dynamic shop scheduling benchmark problems. The results show that the metaheuristic methodology which has been successfully applied to the static shop scheduling problems can also be applied to solve the dynamic shop scheduling problem efficiently. © 2004 Elsevier Ltd. All rights reserved.||Source Title:||Advances in Engineering Software||URI:||http://scholarbank.nus.edu.sg/handle/10635/87072||ISSN:||09659978||DOI:||10.1016/j.advengsoft.2004.10.002|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.