A modified tabu search algorithm for cost-based job shop problem

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.

[1]  John E. Beasley,et al.  OR-Library: Distributing Test Problems by Electronic Mail , 1990 .

[2]  Chandrasekharan Rajendran,et al.  Scheduling in dynamic assembly job-shops with jobs having different holding and tardiness costs , 2003 .

[3]  Rasaratnam Logendran,et al.  A Tabu search-based approach for scheduling job-shop type flexible manufacturing systems , 1997 .

[4]  Ari P. J. Vepsalainen.  Priority rules for job shops with weighted tardiness costs , 1987 .

[5]  Fred W. Glover,et al.  Tabu Search - Part I , 1989, INFORMS J. Comput..

[6]  Egon Balas,et al.  Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm , 1969, Oper. Res..

[7]  Li Congxin,et al.  Solving Job Shop Scheduling Problem by Genetic Algorithm , 2006 .

[8]  Eugeniusz Nowicki,et al.  An Advanced Tabu Search Algorithm for the Job Shop Problem , 2005, J. Sched..

[9]  Egon Balas,et al.  The Shifting Bottleneck Procedure for Job Shop Scheduling , 1988 .

[10]  Michael Pinedo,et al.  A shifting bottleneck heuristic for minimizing the total weighted tardiness in a job shop , 1999 .

[11]  A. Kan.  Machine Scheduling Problems: Classification, Complexity and Computations , 1976 .

[12]  Don T. Phillips,et al.  A state-of-the-art survey of dispatching rules for manufacturing job shop operations , 1982 .

[13]  Chandrasekharan Rajendran,et al.  Scheduling in dynamic assembly job-shops to minimize the sum of weighted earliness, weighted tardiness and weighted flowtime of jobs , 2005, Comput. Ind. Eng..

[14]  C Riago.  TARDINESS MINIMIZATION IN A FLEXIBLE JOB SHOP: A TABU SEARCH APPROACH , 2004 .

[15]  Samuel Eilon,et al.  Due dates in job shop scheduling , 1976 .

[16]  E. Nowicki,et al.  A Fast Taboo Search Algorithm for the Job Shop Problem , 1996 .

[17]  L. Darrell Whitley,et al.  Problem difficulty for tabu search in job-shop scheduling , 2003, Artif. Intell..

[18]  Chandrasekharan Rajendran,et al.  Performance evaluation of priority dispatching rules in multi-level assembly job shops with jobs having weights for flowtime and tardiness , 2006 .

[19]  Mitsuo Gen,et al.  Solving job-shop scheduling problems by genetic algorithm , 1994, Proceedings of IEEE International Conference on Systems, Man and Cybernetics.

[20]  K. Bontridder,et al.  Minimizing Total Weighted Tardiness in a Generalized Job Shop , 2005, J. Sched..

[21]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[22]  Jan Karel Lenstra,et al.  Job Shop Scheduling by Simulated Annealing , 1992, Oper. Res..

[23]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[24]  L. Darrell Whitley,et al.  Deconstructing Nowicki and Smutnicki's i-TSAB tabu search algorithm for the job-shop scheduling problem , 2005, Comput. Oper. Res..

[25]  Éric D. Taillard,et al.  Parallel Taboo Search Techniques for the Job Shop Scheduling Problem , 1994, INFORMS J. Comput..