Title :
An application of tabu search algorithm on cost-based job shop problem with multiple objectives
Author :
Zhu, Z.C. ; Ng, K.M. ; Ong, H.L.
Author_Institution :
Nat. Univ. of Singapore, Singapore
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.
Keywords :
costing; job shop scheduling; search problems; MOCB-JSP; multiple objective cost-based job shop problem; schedule quality; tabu search algorithm; Algorithm design and analysis; Computational complexity; Cost function; Dispatching; Genetic algorithms; Job shop scheduling; Mathematical programming; Processor scheduling; Simulated annealing; Systems engineering and theory; Job shop problem; Multiple objectives; Tabu search algorithm;
Conference_Titel :
Industrial Engineering and Engineering Management, 2007 IEEE International Conference on
Conference_Location :
Singapore
Print_ISBN :
978-1-4244-1529-8
Electronic_ISBN :
978-1-4244-1529-8
DOI :
10.1109/IEEM.2007.4419324
