3B4 ON OPTIMAL SCHEDULING PROBLEMS FOR PARALLLEL MACHINES WITH A SINGLE SERVER(Technical session 3B : Combinatorics 2)
スポンサーリンク
概要
- 論文の詳細を見る
In this paper, we deal with parallel machine scheduling problems with a single server that are generalizations of classical paralle machine problems. Immediately before processing, each job must be loaded on a machine, and after processing, each job must be unloaded from the machine, which takes a certain load and unloaded time respectively. All these processes have to be done by a single server which can only handle at most one job at a time. A RCPSP solver is employed for solving the problems and computational results are proposed.
- 社団法人日本機械学会の論文
- 2004-05-24
著者
-
Karuno Yoshiyuki
Kyoto Institute of Technology
-
Xie Changzheng
Kyoto Institute of Technology
-
Kuwata Jo
Kyoto Institute of Technology
-
Kise Hiroshi
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
- A SHIFTING BOTTLENECK APPROACH FOR A PARALLEL-MACHINE FLOWSHOP SCHEDULING PROBLEM
- OPTIMAL SCHEDULING FOR AN AUTOMATED m-MACHINE FLOWSHOP
- OPTIMIZATION IN PRODUCTION SYSTEMS: A SURVEY ON QUEUING APPROACHES
- CONSTANT FACTOR APPROXIMATION ALGORITHMS FOR REPETITIVE ROUTING PROBLEMS OF GRASP-AND-DELIVERY ROBOTS IN PRODUCTION OF PRINTED CIRCUIT BOARDS