Open access peer-reviewed chapter

Hybrid Tabu Search for Re-Entrant Permutation Flow-Shop Scheduling Problem

By Jen-Shiang Chen, Jason Chao-Hsien Pan and Chien-Kuang Wu

Published: September 1st 2008

DOI: 10.5772/5591

Downloaded: 1434

How to cite and reference

Link to this chapter Copy to clipboard

Cite this chapter Copy to clipboard

Jen-Shiang Chen, Jason Chao-Hsien Pan and Chien-Kuang Wu (September 1st 2008). Hybrid Tabu Search for Re-Entrant Permutation Flow-Shop Scheduling Problem, Tabu Search, Wassim Jaziri, IntechOpen, DOI: 10.5772/5591. Available from:

Embed this chapter on your site Copy to clipboard

<iframe src="http://www.intechopen.com/embed/tabu_search/hybrid_tabu_search_for_re-entrant_permutation_flow-shop_scheduling_problem" />

Embed this code snippet in the HTML of your website to show this chapter

chapter statistics

1434total chapter downloads

3Crossref citations

More statistics for editors and authors

Login to your personal dashboard for more detailed statistics on your publications.

Access personal reporting

Related Content

This Book

Next chapter

On the Design of Large-Scale Cellular Mobile Networks Using Tabu Search

By Alejandro Quintero and Samuel Pierre

Related Book

First chapter

Traveling Salesman Problem: an Overview of Applications, Formulations, and Solution Approaches

By Rajesh Matai, Surya Singh and Murari Lal Mittal

We are IntechOpen, the world's leading publisher of Open Access books. Built by scientists, for scientists. Our readership spans scientists, professors, researchers, librarians, and students, as well as business professionals. We share our knowledge and peer-reveiwed research papers with libraries, scientific and engineering societies, and also work with corporate R&D departments and government entities.

More about us