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.
KeywordsSchedule Problem Heuristic Algorithm Optimal Schedule Idle Time Dominance Condition
Unable to display preview. Download preview PDF.