Dynamic Scheduling of Large-scale Flow Shops Based on Relative Priority Approach

スポンサーリンク

概要

• 論文の詳細を見る

• A relative priority approach is proposed to solve dynamic scheduling problem for flow shop problem in this paper. Two neighbor jobs’ relationship is represented by a relative priority, which implies permutation obstacle between them. An algorithm is developed to calculate relative priority matrix on jobs and a near-optimal result can be obtained with the calculation iteration of relative priority matrix. A printed circuit board production line, which is composed of 31 works, is used to demonstrate the efficiency of proposed approach. It shows that an excellent final sequence can be obtained while initial sequence is derived from rule-based result.

• 社団法人 電気学会の論文
• 2003-10-01

著者

• Fujimoto Y

  Yokohama National Univ. Yokohama

• Fujimoto Yasutaka

  Dept. Of Electrical & Computer Engineering Yokohama National University

• YANG Jianhua

  Dept. of Electrical & Computer Engineering, Yokohama National University

• JIANHUA Yang

  Dept. of Electrical & Computer Engineering, Yokohama National University

• Jianhua Y

  Yokohama National Univ. Yokohama

• Fujimoto Yasutaka

  Dept. of Electrical & Computer Eng., Yokohama National University

関連論文

• On Approximation and Smoothing of General Distribution Based on Normal Expansion Method (特集:平成15年電気学会電子・情報・システム部門大会)
• Dynamic Scheduling of Large-scale Flow Shops Based on Relative Priority Approach
• Enhancement of Prediction for Manufacturing System Using Bayesian Decision Recognition (特集:生産・流通システム高度情報化技術)

スポンサーリンク