Abstract
In this research, a selection method of non-dominated schedules is investigated
on m machines open shop scheduling problem with maximum completion times
for each of machines as multiobjective. In formulation of the problem, we introduce a
concept of schedule vector and lexicographic ordering based on burdened machine. For
this problem, the aim is to find a preemptive schedule that lexicographically minimizes
the maximum completion times Cmaxi, i = 1, 2, · · · ,m on m machines Mi, respectively.
We propose a flexible algorithm and discuss its validity and computational
complexity.
