Open access peer-reviewed chapter

Minimizing Makespan in Flow Shop Scheduling Using a Network Approach

By Amin Sahraeian

Downloaded: 3824

Published: January 11th 2012

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 Righi, IntechOpen, DOI: 10.5772/38699. Available from:

Embed this chapter on your site Copy to clipboard

<iframe src="" />

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

chapter statistics

3824total 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

Final Results of Assembly Line Balancing Problem

By Waldemar Grzechca

We are IntechOpen, the first native scientific publisher of Open Access books. 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.

+3,350 Open Access Books

+57,400 Citations in Web of Science

+107,500 IntechOpen Authors and Academic Editors

+560,000 Unique visitors per month

More about us