Minimização do tempo total de atraso no problema de flowshop com buffer zero através de busca tabu

Surveys of production scheduling show that meeting customer due dates is a critical concern in most manufacturing systems. While there is considerable research to minimize the makespan in a flowshop with no storage constraints, very little work has dealt with job total tardiness criterion in a flowshop with blocking in-process. Scheduling problems with blocking arise in serial manufacturing processes where no intermediate buffer storage is available. In this paper we investigate the application of tabu search to this problem in order to explore the solution space. Additional strategies are evaluated. Computational tests are presented and comparisons with the NEH algorithm and with a Branch-and-Bound algorithm are made.

[1]  Inyong Ham,et al.  A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .

[2]  A. Hertz,et al.  A new heuristic method for the flow shop sequencing problem , 1989 .

[3]  João Vitor Moccellin,et al.  A New Heuristic Method for the Permutation Flow Shop Scheduling Problem , 1995 .

[4]  Débora P. Ronconi,et al.  Tabu search for total tardiness minimization in flowshop scheduling problems , 1999, Comput. Oper. Res..

[5]  Colin R. Reeves,et al.  Improving the Efficiency of Tabu Search for Machine Sequencing Problems , 1993 .

[6]  Débora P. Ronconi,et al.  Lower bounding schemes for flowshops with blocking in-process , 2001, J. Oper. Res. Soc..

[7]  Christos Koulamas,et al.  The Total Tardiness Problem: Review and Extensions , 1994, Oper. Res..

[8]  Rainer Leisten,et al.  Flowshop sequencing problems with limited buffer storage , 1990 .

[9]  E. Nowicki,et al.  A fast tabu search algorithm for the permutation flow-shop problem , 1996 .

[10]  J. Grabowski,et al.  On Flow Shop Scheduling with Release and Due Dates to Minimize Maximum Lateness , 1983 .

[11]  Peng Si Ow,et al.  Focused Scheduling in Proportionate Flowshops , 1985 .

[12]  R. Gomory,et al.  Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem , 1964 .

[13]  Michael Pinedo,et al.  Sequencing in an Assembly Line with Blocking to Minimize Cycle Time , 1989, Oper. Res..

[14]  Joseph Y.-T. Leung,et al.  Minimizing Total Tardiness on One Machine is NP-Hard , 1990, Math. Oper. Res..

[15]  Yeong-Dae Kim.  Minimizing total tardiness in permutation flowshops , 1995 .

[16]  Tapan Sen,et al.  A state-of-art survey of static scheduling research involving due dates , 1984 .

[17]  Narayan Raman,et al.  Minimum tardiness scheduling in flow shops: Construction and evaluation of alternative solution approaches , 1995 .

[18]  Chelliah Sriskandarajah,et al.  A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process , 1996, Oper. Res..

[19]  É. Taillard.  Some efficient heuristic methods for the flow shop sequencing problem , 1990 .

[20]  Éric D. Taillard,et al.  Benchmarks for basic scheduling problems , 1993 .

[21]  W. Townsend.  Note---Sequencing n Jobs on m Machines to Minimise Maximum Tardiness: A Branch-and-Bound Solution , 1977 .

[22]  Richard S. H. Mah,et al.  An implicit enumeration scheme for the flowshop problem with no intermediate storage , 1981 .

[23]  Yeong-Dae Kim,et al.  Heuristics for Flowshop Scheduling Problems Minimizing Mean Tardiness , 1993 .

[24]  B. Adenso-Díaz.  Restricted neighborhood in the tabu search for the flowshop problem , 1992 .

[25]  Chris N. Potts,et al.  A decomposition algorithm for the single machine total tardiness problem , 1982, Oper. Res. Lett..

[26]  C. V. Ramamoorthy,et al.  On the Flow-Shop Sequencing Problem with No Wait in Process † , 1972 .