A Branch and Boundary Approach to Two-Stage Hybrid Flow Shop Scheduling Problem with Diverging Jobs and Time Overlap Production

DOI Web Site 1 Citations 11 References

Bibliographic Information

Other Title
  • ジョブの分岐と重複生産を許す2工程並列機械フローショップスケジューリング問題 : 分枝限定法によるアプローチ
  • ジョブ ノ ブンキ ト チョウフク セイサン オ ユルス 2 コウテイ ヘイレツ キカイ フローショップスケジューリング モンダイ ブン シ ゲンテイホウ ニ ヨル アプローチ

Search this article

Abstract

We consider a two-stage hybrid flow shop scheduling problem minimizing makespan. The problem has some features, namely, i) a job in the upper stage can be split up into sub-jobs in the lower stage, and ii) time overlap production is permitted, which theoretical scheduling models have never contained. We regard it as a combinatorial optimization problem and propose methods of obtaining the lower boundary of makespan and an algorithm based on a branch and boundary method. We also discuss efficiency of the algorithm by computational experiments. The motivation for this research is a real scheduling problem in the processing industry.

Journal

Citations (1)*help

See more

References(11)*help

See more

Keywords

Details 詳細情報について

Report a problem

Back to top