1B2 AN APPLICATION OF THE GENETIC ALGORITHM TO A TWO-MACHINE ROBOTIC FLOW-SHOP SCHEDULING PROBLEM(Technical session 1B : Meta Heuristics)
スポンサーリンク
概要
- 論文の詳細を見る
In this paper, we deal with a two-machine robotic flow-shop. There is an intermediate station with a finite capacity bound between the two machines for intermediate operations such as washing, cooling, chip disposal, and so on. Each job is processed on the first machine, and then on the bounded intermediate station, and finally on the second machine. In this paper, we propose a heuristic algorithm to the scheduling problem of minimizing the makespan. The heuristic is designed to handle non-permutation schedules, using some genetic operators such as crossover and selection. The performance is examined by means of numerical experiments.
- 一般社団法人日本機械学会の論文
- 2004-05-24
著者
-
KARUNO Yoshiyuki
Department of Mechanical and System Engineering, Kyoto Institute of Technology
-
Kise Hiroshi
Department Of Mechanical And System Engineering Kyoto Institute Of Technology
-
Karuno Yoshiyuki
Department Of Mechanical And System Engineering Kyoto Institute Of Technology
-
Karuno Yoshiyuki
Department Of Mechanical And System Engineering Faculty Of Engineering And Design Kyoto Institute Of
-
Hata Yusuke
Department of Mechanical and System Engineering Kyoto Institute of Technology
関連論文
- Optimization Problems and Algorithms in Double-layered Food Packing Systems
- 1A1 COMBINATORIAL OPTIMIZATION PROBLEMS AND ALGORITHMS IN DOUBLE-LAYERED FOOD PACKING EQUIPMENTS
- 4C1 SCHEDULING MULTIPROCESSOR TASKS WITH PROMPT SERVICE CONSTRAINTS ON ALIGNED IDENTICAL PROCESSORS
- B34 Hardness of Approximating Transshipment Problems with Permutable Transit Vectors(Advanced machining technology)
- 3C3 A TRANSSHIPMENT PROBLEM WITH A PREMUTABLE TRANSIT VECTOR
- 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
- VEHICLE SCHEDULING ON A TREE TO MINIMIZE MAXIMUM LATENESS
- OPTIMAL SCHEDULING FOR AN AUTOMATED m-MACHINE FLOWSHOP
- A Dynamic Programming Based Improvement Heuristic for a Repetitive Routing Problem of Grasp-and-Delivery Robots
- CONSTANT FACTOR APPROXIMATION ALGORITHMS FOR REPETITIVE ROUTING PROBLEMS OF GRASP-AND-DELIVERY ROBOTS IN PRODUCTION OF PRINTED CIRCUIT BOARDS
- Dynamic Programming Algorithms with Data Rounding for Combinatorial Food Packing Problems
- Better Approximation Algorithms for Grasp-and-Delivery Robot Routing Problems
- 4A2 NETWORK TRANSFORMATION HEURISTICS FOR MULTI-STORY STORAGE RACK PROBLEMS(Technical session 4A: Material handling system)
- 5B1 IMPROVED IMPLEMENTATION OF AN APPROXIMATION ALGORITHM WITH FACTOR TWO FOR A CYCLIC ROUTING PROBLEM OF GRASP-AND-DELIVERY ROBOTS(Technical session 5B: Routing problems)
- 5B3 APPROXIMATING CYCLIC ROUTING PROBLEMS OF GRASP-AND-DELIVERY ROBOTS IN PRODUCTION OF PRINTED CIRCUIT BOARDS(Technical session 5B: Routing problems)
- Scheduling Capacitated One-Way Vehicles on Paths with Deadlines