Flexible Flow Shop Scheduling Problem Research Articles

203 有限バッファ柔軟フローショップスケジューリングに関する研究 : 実生産工場への応用(生産システム)

203 有限バッファ柔軟フローショップスケジューリングに関する研究 : 実生産工場への応用(生産システム)

Flexible flow shop scheduling: optimum, heuristics and artificial intelligence solutions

Abstract: For the past three decades or so the flexible flow shop (FFS) scheduling problem has attracted many researchers. Numerous research articles have been published on this topic. This study reviews research on the FFS scheduling problem from the past and the present. The solution approaches reviewed range from the optimum to heuristics and to artificial intelligence search techniques. I not only discuss the details from the selected methods and compare them, but also provide insights and suggestions for future research.

A note on weighted completion time minimization in a flexible flow shop

We consider the flexible flow shop scheduling problem with the weighted completion time minimization objective. We show that an extension of the weighted shortest processing time heuristic to the flexible flow shop case yields a worst-case ratio bound for this problem. A sharper bound is obtained for either the unweighted case or the case where there is a single machine in at least one stage.