A FAST TABU SEARCH ALGORITHM FOR FLOW SHOP PROBLEM WITH BLOCKING

Jozef Grabowski, Jaroslaw Pempera

Abstract

This paper develops a fast tabu search algorithm to minimize makespan in a flow shop problem with blocking. We present a fast heuristic algorithm based on tabu search approach. In the algorithm the multimoves are used that consist in performing several moves simultaneously in a single iteration of algorithm and guide the search process to more promising areas of the solutions space, where good solutions can be found. It allow us to accelerate the convergence of the algorithm. Besides, in the algorithm a dynamic tabu list is used that assists additionally to avoid being trapped at a local optimum. The proposed algorithm is empirically evaluated and found to be relatively more effective in finding better solutions in a much shorter time.

References

  1. Abadi, I. N. K., Hall, N., and Sriskandarayah, C. (2000). Minimizing cycle time in a blocking flowshop. Operations Research, 48:177-180.
  2. Caraffa, V., Ianes, S., Bagchi, T., and Sriskandarayah, C. (2001). Minimizing makespan in a blocking flowshop using genetic algorithms. International Journal of Production Economics, 70:101-115.
  3. Gilmore, P. and Gomory, R. (1964). Sequencing a statevariable machine: a solvable case of the traveling salesman problem. Operations Research, 12:655- 679.
  4. Gilmore, P., Lawler, E., and Shmoys, D. (1985). Wellsolved special cases. E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, D.B. Shmoys (Eds), The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. Wiley: Chichester, pages 87-143.
  5. Glover, F. (1989). Tabu search. part i. ORSA Journal of Computing, 1:190-206.
  6. Glover, F. (1990). Tabu search. part ii. ORSA Journal of Computing, 2:4-32.
  7. Grabowski, J. and Pempera, J. (2000). Sequencing of jobs in some production system. European Journal of Operational Research, 125:535-550.
  8. Grabowski, J. and Wodecki, M. (2004). A very fast tabu search algorithm for the flow shop problem with makespan criterion. Computers and Operations Research, 11:1891-1909.
  9. Hall, N. and Sriskandarajah, C. (1996). A survey of machine scheduling problems with blocking and no-wait in process. Operations Research, 44:510-525.
  10. Leistein, R. (1990). Flowshop sequencing with limited buffer storage. International Journal of Production Research, 28:2085-2100.
  11. McCormick, M., Pinedo, M., Shenker, S., and Wolf, B. (1989). Sequencing in an assembly line with blocking to minimize cycle time. Operations Research, 37:925-935.
  12. Nawaz, M., Enscore, E., and Ham, I. (1983). A heuristic algorithm for the m-machine, n-job flowshop sequencing problem. OMEGA The International Journal of Management Science, 11:91-95.
  13. Nowicki, E. (1999). The permutation flow shop with buffers: A tabu search approach. European Journal of Operational Research, 116:205-219.
  14. Peng, Y., Soong, B., and Wang, L. (2004). Electronics Letters, 40:375-376.
  15. Reddi, S. and Ramamoorthy, C. (1972). On flowshop sequencing problems with no-wait in process. Operational Research Quarterly, 23:323-331.
  16. Ronconi, D. (2004). A note on constructive heuristics for the flowshop problem with blocking. International Journal of Production Economics, 87:39-48.
  17. Ronconi, D. and Armentano, V. (2001). Lower bounding schemes for flowshops with blocking inprocess. Journal of the Operational Research Society, 52:1289-1297.
  18. Smutnicki, C. (1983). Some properties of scheduling problem with storing constraints. Zeszyty Naukowe AGH: Automatyka (in Polish), 34:223-232.
  19. Taillard, E. (1993). Benchmarks for basic scheduling problems. European Journal of Operational Research, 64:278-285.
Download


Paper Citation


in Harvard Style

Grabowski J. and Pempera J. (2005). A FAST TABU SEARCH ALGORITHM FOR FLOW SHOP PROBLEM WITH BLOCKING . In Proceedings of the Second International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO, ISBN 972-8865-29-5, pages 71-76. DOI: 10.5220/0001160900710076


in Bibtex Style

@conference{icinco05,
author={Jozef Grabowski and Jaroslaw Pempera},
title={A FAST TABU SEARCH ALGORITHM FOR FLOW SHOP PROBLEM WITH BLOCKING},
booktitle={Proceedings of the Second International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO,},
year={2005},
pages={71-76},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0001160900710076},
isbn={972-8865-29-5},
}


in EndNote Style

TY - CONF
JO - Proceedings of the Second International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO,
TI - A FAST TABU SEARCH ALGORITHM FOR FLOW SHOP PROBLEM WITH BLOCKING
SN - 972-8865-29-5
AU - Grabowski J.
AU - Pempera J.
PY - 2005
SP - 71
EP - 76
DO - 10.5220/0001160900710076