Multiobjective Flowshop Scheduling

  • Tapan P. Bagchi


It was mentioned in Chapter 4 that in sequencing jobs in a flowshop we are likely to confront several different (and often conflicting) management objectives. Consequently, a schedule may have to be evaluated by different types of performance measures. Some of these measures may give importance to completion time (e.g. makespan), some to due date (e.g. mean tardiness, maximum tardiness), and some others to the speed with which the jobs flow (e.g. mean flow time). The simultaneous consideration of these objectives is a multiobjective optimization problem. But, even for a single objective, flowshop sequencing is NP-hard. Therefore, solving even a single objective flowshop problem involving only 15-20 machines and 30-40 jobs by classical optimization methods would be quite difficult.


Pareto Optimal Solution Multiobjective Optimization Problem Nondominated Solution Objective Weighting Single Objective Function 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 1999

Authors and Affiliations

  • Tapan P. Bagchi
    • 1
  1. 1.Indian Institute of Technology KanpurIndia

Personalised recommendations