Mohammad Reza Skandari

Learn More
The flowshop sequence dependent group scheduling problem with minimization of makespan as the objective (F m |fmls, S plk , prmu|C max) is considered in this paper. It is assumed that several groups with different number of jobs are assigned to a flow shop cell that has m machines. The goal is to find the best sequence of processing the jobs in each group(More)
  • 1