A New Lower Bound for Flexible Flow Shop Problem with Unrelated Parallel Machines

Abstract

Flexible flow shop scheduling problem (FFS) with unrelated parallel machines contains sequencing in flow shop where, at any stage, there exists one or more processors. The objective consists of minimizing the maximum completion time. Because of NP-completeness of FFS problem, it is necessary to use heuristics method to address problems of moderate to large scale problem. Therefore, for assessment the quality of this heuristic, this paper develop a global lower bound on FFS makespan problems with unrelated parallel machines.

Keywords

• lower bound
• flexible flow shop
• makespan
• unrelated parallel machines