Please use this identifier to cite or link to this item:
|Title:||An application of tabu search algorithm on cost-based job shop problem with multiple objectives||Authors:||Zhu, Z.C.
|Keywords:||Job shop problem
Tabu search algorithm
|Issue Date:||2007||Citation:||Zhu, Z.C., Ng, K.M., Ong, H.L. (2007). An application of tabu search algorithm on cost-based job shop problem with multiple objectives. IEEM 2007: 2007 IEEE International Conference on Industrial Engineering and Engineering Management : 912-916. ScholarBank@NUS Repository. https://doi.org/10.1109/IEEM.2007.4419324||Abstract:||A cost-based job shop problem with multiple objectives (MOCB-JSP) is proposed in this paper. Three different objectives are considered in the objective function of MOCB-JSP: work in progress (WIP) holding cost, earliness cost and tardiness cost. Tabu search algorithm is applied to improve the initial schedules of MOCB-JSP. Extensive experiments are conducted to test the performance of the tabu search when different parameter combinations are taken. Computational results show that tabu search with a properly configured parameter combination significantly improves the schedule quality with reasonable computational effort. © 2007 IEEE.||Source Title:||IEEM 2007: 2007 IEEE International Conference on Industrial Engineering and Engineering Management||URI:||http://scholarbank.nus.edu.sg/handle/10635/72280||ISBN:||1424415292||DOI:||10.1109/IEEM.2007.4419324|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 2, 2019
checked on Dec 1, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.