Shop problems



In this section we are interested in multicriteria flowshop scheduling problems with two machines. Each job J i is processed on the machine M1 for a duration p i ,1 then on the machine M 2 for a duration p i,2- In this context, the multicriteria scheduling problem which is addressed the most in the literature involves the minimisation of the criteria math and C max . Different scheduling problems are derived according to the form of the considered objective function.


Schedule Problem Heuristic Algorithm Optimal Schedule Idle Time Dominance Condition 
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-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  1. 1.Laboratoire d’InformatiqueUniversité François-Rabelais ToursToursFrance

Personalised recommendations