A FLOWSHOP SCHEDULING ALGORITHM TO MINIMIZE TOTAL FLOWTIME

スポンサーリンク

概要

• 論文の詳細を見る

• In this paper a heuristic algorithm is presented for scheduling in flowshops with the objective of minimizing the sum of completion times or total flowtime of jobs. The algorithm is developed by considering the lower bound on completion times of jobs for various stages of flowshop. Since the proposed lower bound will also hold for the flowshop with no job-waiting constraint at some or all stages of processing, the heuristic can as well be applied to such flowshop problems. The performance of the heuristic algorithm in all types of flowshop problems has been evaluated. It is found to be consistently good and superior to the existing flowshop scheduling algorithms.

• 社団法人日本オペレーションズ・リサーチ学会の論文

著者

• Chaudhuri Dipak

  Indian Institute Of Technology

• Raiendran Chandrasekharan

  Indian Institute of Technology

関連論文

• A FLOWSHOP SCHEDULING ALGORITHM TO MINIMIZE TOTAL FLOWTIME

スポンサーリンク