A FAST TABU SEARCH ALGORITHM FOR FLOW SHOP PROBLEM WITH BLOCKING

Jozef Grabowski, Jaroslaw Pempera

2005

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.

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