Open access peer-reviewed chapter

Minimizing Makespan in Flow Shop Scheduling Using a Network Approach

By Amin Sahraeian

Submitted: June 28th 2011Reviewed: July 11th 2011Published: January 11th 2012

DOI: 10.5772/38699

Downloaded: 4419

© 2012 The Author(s). Licensee IntechOpen. This chapter is distributed under the terms of the Creative Commons Attribution 3.0 License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

How to cite and reference

Link to this chapter Copy to clipboard

Cite this chapter Copy to clipboard

Amin Sahraeian (January 11th 2012). Minimizing Makespan in Flow Shop Scheduling Using a Network Approach, Production Scheduling, Rodrigo da Rosa Righi, IntechOpen, DOI: 10.5772/38699. Available from:

chapter statistics

4419total chapter downloads

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

Lot Processing in Hybrid Flow Shop Scheduling Problem

By Larysa Burtseva, Rainier Romero, Salvador Ramirez, Victor Yaurima, Félix F. González-Navarro and Pedro Flores Perez

Related Book

First chapter

Global Optimization Using Local Search Approach for Course Scheduling Problem

By Ade Jamal

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