A SHIFTING BOTTLENECK APPROACH FOR A PARALLEL-MACHINE FLOWSHOP SCHEDULING PROBLEM
スポンサーリンク
概要
- 論文の詳細を見る
This paper considers a scheduling problem of minimizing the maximum lateness for a parallel-machine flowshop with m stages, each of which consists of one or more identical parallel machines. We propose a heuristic algorithm being based on a shifting bottleneck approach which decomposes the parallel-machine flowshop problem into m parallel-machine scheduling problems to be solved one by one. Each parallel-machine problem is approximately solved by applying a property of its reversibility in the proposed heuristic. To evaluate performance of the proposed heuristic, it is numerically compared with Wittrock's algorithm for a real production line, and with Santos et al.'s global lower bound for test problem instances randomly generated. The results obtained strongly suggest that the proposed heuristic produces optimal or quite near optimal solutions within short computational time with high probability.
- 社団法人日本オペレーションズ・リサーチ学会の論文
著者
-
Karuno Yoshiyuki
Kyoto Institute of Technology
-
Kise Hiroshi
Department Of Mechanical And System Engineering Kyoto Institute Of Technology
-
Kise Hiroshi
Department Of Mechanical And System Engineering Kyoto Institute Of Technology:faculty Of Engineering
-
Karuno Y
Kyoto Institute Of Technology
-
Cheng Jinliang
Kyoto Institute of Technology
関連論文
- AN INAPPROXIMABILITY OF TRANSSHIPMENT PROBLEMS WITH PERMUTABLE TRANSIT VECTORS
- 1A1 COMBINATORIAL OPTIMIZATION PROBLEMS AND ALGORITHMS IN DOUBLE-LAYERED FOOD PACKING EQUIPMENTS
- 3B4 ON OPTIMAL SCHEDULING PROBLEMS FOR PARALLLEL MACHINES WITH A SINGLE SERVER(Technical session 3B : Combinatorics 2)
- BI-CRITERIA FOOD PACKING BY DYNAMIC PROGRAMMING(the 50th Anniversary of the Operations Research Society of Japan)
- B34 Hardness of Approximating Transshipment Problems with Permutable Transit Vectors(Advanced machining technology)
- ANALYSIS AND OPTIMIZATION FOR AUTOMATED VEHICLE ROUTING ON A SINGLE LOOP(Advanced Planning and Scheduling for Supply Chain Management)
- 2-B-5 A HEURISTIC ALGORITHM FOR OPERATING A PERMUTATIONAL CIRCULATION-TYPE VEHICLE ROUTING SYSTEM
- 1B2 AN APPLICATION OF THE GENETIC ALGORITHM TO A TWO-MACHINE ROBOTIC FLOW-SHOP SCHEDULING PROBLEM(Technical session 1B : Meta Heuristics)
- A SHIFTING BOTTLENECK APPROACH FOR A PARALLEL-MACHINE FLOWSHOP SCHEDULING PROBLEM
- Analysis of a Loop-flow Type of Automated Manufacturing System : Vibration, Control Engineering, Engineering for Industry
- Automatic Recognition Method of the Reversed Flow Region in Digitalized Path-Line Pictures
- OPTIMAL SCHEDULING FOR AN AUTOMATED m-MACHINE FLOWSHOP
- CONSTANT FACTOR APPROXIMATION ALGORITHMS FOR REPETITIVE ROUTING PROBLEMS OF GRASP-AND-DELIVERY ROBOTS IN PRODUCTION OF PRINTED CIRCUIT BOARDS