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

英文論文誌　Journal of the Operations Research Society of Japan (1983) 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.26 No.1 Optimum Inspection policy for a Protective Device ETSURO SHIMA（Togota Motor Co., Ltd.），TOSHIO NAKAGAWA, YOSHIYA SAWA（Meijo University） Algorithmic Methods for PH / PH / 1 Queues with Batch Arrivals or Services YUTAKA BABA（Tokyo Institute of Technology） An Algorithmic Solution to the M / PH / 1Queue with Batch Arrivals or Services YUTAKA BABA（Tokyo Institute of Technology） An Application of the Lumping Method to a Loss System with Two Types of Customers TSUKASA SANO（Nissan Diesel Co. Ltd.），MASAO MORI（Tokyo Institute of Technology） On the Practical Efficiency of Various Maximum Flow Algorithms HIROSHI IMAI（University of Tokyo） ▲ Vol.26 No.2 An Optimization Problem in a Finite Markov Chain Applied to Solid Particle Mixing KEISUKE UCHIMURA, TADASHI YOSHIZAWA, KENICHI SHIMURA（Yamanashi University） An Optimum Inspection Policy for a One-Unit System with Preventive Maintenance KOUICHI ADACHI（Nagoya Institute of Technology），TOSHIO NISHIDA（Osaka University） Bounds and an Approximation for Single Server Queues JEYAVEERASINGAM GEORGE SHANTHIKUMAR（Syracuse University） LIFO Allocation Problem for Perishable Commodities TOYOKAZU NOSE（Osaka Institute of Technology），HIROAKI ISHII, TOSHIO NISHIDA（Osaka University） Optimal Service-Rate Control of Exponential Queueing Systems KYUNG Y. JO（George Mason University） ▲ Vol.26 No.3 The Lexico-Shortest Route Algorithm for Solving the Minimum Cost Flow Problem with an Additional Linear Constraint TAKASHI KOBAYASHI（Saitama University） Network-Flow Algorithms for Lower-Truncated Transversal Polymatroids HIROSHI IMAI（University of Tokyo） Some Bounds on Approximation Algorithms for n/m/I/Lmax and n / 2 / F / L max Scheduling Problems TERUO MASUDA（University of Osaka Prefecture），HIROAKI ISHII, TOSHIO NISHIDA（Osaka University） Optimal Schedule in a GT-Type Flow-Shop under Series-Parallel Precedence Constraints YASUKI SEKIGUCHI（Hokkaido University） Theoretical Analysis of Dynamic Behaviours in System Dynamics SHIZUO MAWATARAI（Aoyama Gakuin University） ▲ Vol.26 No.4 An Optimal Ordering and Replacement Policy of a Markovian Degradation System under Complete Observation Part I HAJIME KAWAI（University of Osaka Prefecture） An Optimal Ordering and Replacement Policy of a Markovian Deterioration System under Incomplete Observation Part II HAJIME KAWAI（University of Osaka Prefecture） A Note on Submodular Functions on Distributive Lattices SATORU FUJISHIGE（University of Tsukuba），NOBUAKI TOMIZAWA（Niigata University） The Effect of Innovativeness of Project and Participation of Concerned Parties on the Success of OR / MS Projects TADAAKI NEMOTO（Aoyama Gakuin University） Replacement Policies in the Case that Failure Distributions Depend on the Number of Failures MASAAKI KIJIMA（Tokyo Institute of Technology） On Certainty Effect in Expected Utility Theory YOSHIO TABATA（Osaka University）       ▲