日本オペレーションズ・リサーチ学会HP アーカイブ集Top

英文論文誌　Journal of the Operations Research Society of Japan (1984) Vol.64 Vol.63 Vol.62 Vol.61 Vol.60 Vol.59 Vol.58 Vol.57 Vol.56 Vol.55 Vol.54 Vol.53 Vol.52 Vol.51 Vol.50 Vol.49 Vol.48 Vol.47 Vol.46 Vol.45 Vol.44 Vol.43 Vol.42 Vol.41 Vol.40 Vol.39 Vol.38 Vol.37 Vol.36 Vol.35 Vol.34 Vol.33 Vol.32 Vol.31 Vol.30 Vol.29 Vol.28 Vol.27 Vol.26 Vol.25 Vol.24 Vol.23 Vol.22 Vol.21 Vol.20 Vol.19 Vol.18 Vol.17 Vol.16 Vol.15 Vol.14 Vol.13 Vol.12 Vol.11 Vol.10 Vol.9 Vol.8 Vol.7 Vol.6 Vol.5 Vol.4 Vol.3 Vol.2 Vol.1 No.1　　No.2　　No.3　　No.4 Vol.27 No.1 Optimal Search and Stop in Continuous Search Process KOJI IIDA（The National Defense Academy） On the Impact of Uncertainty in Dynamic Job Search KATSUSHIGE SAWAKI（Nanzan University），TOSHIO NISHIDA（Osaka University） Practical Efficiencies of Existing Shortest-Path Algorithms and a New Bucket Algorithm HIROSHI IMAI, MASAO IRI（University of Tokyo） Improving the Computational Efficiency of Fixed Point Algorithms BING YANG（Harbin Shipbuilding Institute），MASAKAZU KOJIMA（Tokyo Institute of Technology） Diffusion Approximation for a GI/G/m Queue with Group Arrivals TADASHI OHSONE（Tokyo Institute of Technology） ▲ Vol.27 No.2 On the Class of Closed Dynamic Programs KATSUSHIGE SAWAKI（Nanzan University） A Characterization of Faces of the Base Polyhedron Associated with a Submodular System SATORU FUJISHIGE（University of Tsukuba） Stationary Waiting Time Distribution in a GI/Ek/m Queue AKIHIKO ISHIKAWA（Science University of Tokyo） A Nonsmooth Optimization Approach to Nonlinear Multicommondity Network Flow Problems MASAO FUKUSHIMA（Kyoto University） Formulation of Fuzzy Linear Programming Problem Based on Fuzzy Objective Function HIDEO TANAKA, HIDETOMO ICHIHASHI, KIYOJI ASAI（University of Osaka Prefecture） ▲ Vol.27 No.3 Relationships Between Time/Customer Stationary Characteristics of Tandem Queues Attended by a Single Server DIETER KONIG, VOLKER SCHMIDT（Mining Academy of Freiberg） Optimal Tool Module Design Problem for NC Machine Tools RYUICHI HIRABAYASHI（Tokyo Science University），HISATOSHI SUZUKI（Tokyo Institute of Technology），NOBORU TSUCHIYA（Hitachi Production Engineering Research Laboratory） The Lexico-Bounded Flow Algorithm for Solving the Minimum Cost Project Scheduling Problem with an Additional Linear Constraint TAKASHI KOBAYASHI（Saitama University） Stable Sets for Simple Games with Oridinal Preferences SHIGEO MUTO（Tohoku University） The MXG/1 Queue with Finite Waiting Room YUTAKA BABA（Chubu University） ▲ Vol.27 No.4 Optimum Portfolio of ″Sogo (synthetic) Bank Account″ KIYOSHI KUGA, HIROAKI NAGATANI（Osaka University） Improvements of the Incremental Method for the Voronoi Diagram with Computational Comparison of Various Algorithms TAKAO OHYA（Central Research Institute of Electric Power Industry），MASAO IRI（University of Tokyo），KAZUO MUROTA（University of Tsukuba） Invariance Relations olGI/G/l with LCFS GENJI YAMAZAKI（Kogakuin University） Two-and Three-Machine Flow-Shop Makespan Scheduling Problems with Additional Times Separated from Processing Times ICHIRO NABESHIMA, SHIGEKO MARUYAMA（University of Electro-Communications） ▲