Jacques Teghem

Learn More
The paper considers the 2-stage flow shop problem with parallel dedicated machines. In such a situation, each job can only be processed on a pre specified subset of machines. A mathematical model for this problem is proposed to minimize the maximum completion time among all jobs commonly known as the makespan or the Cmax. Furthermore, two approximate(More)
  • 1