Please use this identifier to cite or link to this item:
|Title:||A modified tabu search algorithm for cost-based job shop problem||Authors:||Zhu, Z.C.
Job shop problem
|Issue Date:||Apr-2010||Citation:||Zhu, Z.C., Ng, K.M., Ong, H.L. (2010-04). A modified tabu search algorithm for cost-based job shop problem. Journal of the Operational Research Society 61 (4) : 611-619. ScholarBank@NUS Repository. https://doi.org/10.1057/jors.2009.9||Abstract:||In this paper, a cost-based job shop problem (JIT-JSP) is proposed to model the multi-order processing procedure in a just-in-time (JIT) environment. The objective of JIT-JSP is to minimize three costs: work-in-process holding cost of half-finished orders, inventory holding cost of finished orders and backorder cost of unfulfilled orders. A modified tabu search (MTS) method is developed to improve the schedule quality by searching the neighbourhood of a feasible schedule iteratively. The MTS method is comprised of three components that help to ensure a more effective searching procedure: neighbourhood structure, memory structure and filter structure. Computational results show that the MTS method significantly improves the initial schedule generated by an arbitrarily selected dispatching rule. © 2010 Operational Research Society Ltd. All rights reserved.||Source Title:||Journal of the Operational Research Society||URI:||http://scholarbank.nus.edu.sg/handle/10635/54429||ISSN:||01605682||DOI:||10.1057/jors.2009.9|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Oct 17, 2020
WEB OF SCIENCETM
checked on Oct 9, 2020
checked on Oct 5, 2020
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.