Article ID: | iaor20102629 |
Volume: | 61 |
Issue: | 4 |
Start Page Number: | 611 |
End Page Number: | 619 |
Publication Date: | Apr 2010 |
Journal: | Journal of the Operational Research Society |
Authors: | Zhu Z C, Ng K M, Ong H L |
Keywords: | production: JIT |
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.