No.1 No.2 No.3 No.4
|
| Vol.39 No.1 |
ANALYSIS OF A DISCRETE-TIME QUEUE WITH GEOMETRICALLY DISTRIBUTED GATE OPENING INTERVALS
Fumio Ishizaki（The University of Tokushima），Tetsuya Takine（Osaka University），Toshiharu Hasegawa（Kyoto University） |
A BULK SERVICE GI/M/l QUEUE WITH SERVICE RATES DEPENDING ON SERVICE BATCH SIZE
Yutaka Baba（Yokohama National University） |
CAPACITY DESIGN IN A FLEXIBLE MANUFACTURING SYSTEM WITH LIMITED WAREHOUSE CAPACITY AND THE LIMITED NUMBER OF PALLETS
Hiroyuki Nagasawa（Osaka Prefecture University） |
A PRACTICAL ALGORITHM FOR MINIMIZING A RANK-TWO SADDLE FUNCTION ON A POLYTOPE
Takahito Kuno（University of Tsukuba） |
A SHORTEST PATH PROBLEM ON THE NETWORK WITH AGV-TYPE TIME-WINDOWS
Ryusuke Hohzaki（National Defense Academy），Susumu Fujii（Kobe University），Hiroaki Sandoh（University of Marketing & Management Science） |
COMBINATORIAL APPROACHES FOR HARD PROBLEMS IN MANPOWER SCHEDULING
Hoong Chuin Lau（Tokyo Institute of Technology） |
THE MEAN-VARIANCE APPROACH TO PORTFOLIO OPTIMIZATION SUBJECT TO TRANSACTION COSTS
Atsushi Yoshimoto（Miyazaki University） |
A PREEMPTIVE PRIORITY QUEUE AS A MODEL WITH SERVER VACATIONS
Fumiaki Machihara（NTT Laboratories） |
▲ |
| Vol.39 No.2 |
CONSTRUCTING CACTUS REPRESENTATION FOR ALL MINIMUM CUTS IN AN UNDIRECTED NETWORK
Hiroshi Nagamochi（Kyoto University），Tiko Kameda（Simon Fraser University） |
事業体間の相互評価情報を用いた調和的な効率性評価法
杉山 学，山田 善靖（東京理科大学） |
AN ALGORITHM FOR A MULTIOBJECTIVE, MULTILEVEL LINEAR PROGRAMMING
Zhi-Wei Wang（Shinwa Kogyo Co.），Hiroyuki Nagasawa（Osaka Prefecture University），Noriyuki Nishiyama（Osaka Institute of Technology） |
MAP/G/1 QUEUES UNDER N-POLICY WITH AND WITHOUT VACATIONS
Shoji Kasahara（Kyoto University），Tetsuya Takine（Osaka University），Yutaka Takahashi, Toshiharu Hasegawa（Kyoto University） |
PARTIAL PROXIMAL METHOD OF MULTIPLIERS FOR CONVEX PROGRAMMING PROBLEMS
Satoru Ibaraki, Masao Fukushima（Kyoto University） |
GRAPHICAL/STATISTICAL APPROACH TO REPAIR LIMIT REPLACEMENT PROBLEM
Hirofumi Koshimae, Tadashi Dohi（Hiroshima University），Naoto Kaio（Hiroshima Shudo University），Shunji Osaki（Hiroshima University） |
必然性測度に基づくファジイ・スパニング・ツリー問題の一解決
伊藤 健，石井 博昭（大阪大学） |
APPLICATION OF THE GRAPH COLORING ALGORITHM TO THE FREQUENCY ASSIGNMENT PROBLEM
Taehoon Park, Chae Y. Lee（Korea Advanced Institute of Science and Technology） |
A NONPREEMPTIVE PRIORITY MAP/G/1 QUEUE WITH TWO CLASSES OF CUSTOMERS
Tetsuya Takine（Osaka University） |
▲ |
| Vol.39 No.3 |
BOND PORTFOLIO OPTIMIZATION PROBLEMS AND THEIR APPLICATIONS TO INDEX TRACKING:A PARTIAL OPTIMIZATION APPROACH
Hiroshi Konno, Hidetoshi Watanabe（Tokyo Institute of Technology） |
A SECRETARY PROBLEM WITH UNCERTAIN EMPLOYMENT WHEN THE NUMBER OF OFFERS IS RESTRICTED
Katsunori Ano（Nanzan University），Mitsushi Tamaki（Aichi University），MuCi Hu（Nagoya Institute of Technology） |
MINIMIZING TOTAL TARDINESS FOR SINGLE MACHINE SEQUENCING
Tsung-Chyan Lai, Yuh-Kwo Kuo（National Taiwan University） |
MODELS AND MEASURES FOR EFFICIENCY DOMINANCE IN DEA Part I:Additive Models and MED Measures
I. Bardhan（The University of Texas at Austin），W. F. Bowlin（University of Northern Iowa），W. W. Cooper（The University of Texas at Austin），T. Sueyoshi（Science University of Tokyo） |
MODELS AND MEASURES FOR EFFICIENCY DOMINANCE IN DEA PartII:Free Disposal Hull(FDH)and Russell Measure(RM)Approaches
I. Bardhan（The University of Texas at Austin），W. F. Bowlin（University of Northern Iowa），W. W. Cooper（The University of Texas at Austin），T. Sueyoshi（Science University of Tokyo）
|
VEHICLE SCHEDULING ON A TREE TO MINIMIZE MAXIMUM LATENESS
Yoshiyuki Karuno（Kyoto Institute of Technology），Hiroshi Nagamochi, Toshihide Ibaraki（Kyoto University） |
GLOBAL OPTIMIZATION PROBLEM WITH MULTIPLE REVERSE CONVEX CONSTRAINTS AND ITS APPLICATION TO OUT-OF-ROUNDNESS PROBLEM
Yang Dai（Kobe University of Commerce），Jianming Shi（Science University of Tokyo），Yoshitsugu Yamamoto（University of Tsukuba ） |
分割配送路問題−ラグランジュ緩和を利用した解法について−
毛利 裕昭（三菱総合研究所），久保 幹雄（東京商船大学），森 雅夫，矢島 安敏（東京工業大学） |
RELIABILITY OF A CIRCULAR CONNECTED-(r,s)-OUT-OF-(m,n):F LATTICE SYSTEM
Hisashi Yamamoto（Teikyo University of Science and Technology），Masami Miyakawa（University of Tokyo） |
A BLOCK-PARALLEL CONJUGATE GRADIENT METHOD FOR SEPARABLE QUADRATIC PROGRAMMING PROBLEMS
Eiki Yamakawa（Takamatsu University），Masao Fukushima（Kyoto University） |
OPTIMAL NUMBER OF DIGITS TO REPORT
Kiyoshi Yoneda（Toshiba R&D Center） |
A SEQUENTIAL ALLOCATION PROBLEM WITH SEARCH COST WHERE THE SHOOT-LOOK-SHOOT POLICY IS EMPLOYED
Masahiro Sato（University of Tsukuba） |
▲ |
| Vol.39 No.4 |
ランダム順処理規則に従うゲート式M[X]/G/1システムの待ち時間の解析
川崎 紀一（京都大学），高木 英明（筑波大学），高橋 豊（奈良先端科学技術大学院大学），長谷川 利治（京都大学） |
A DEA SELECTION SYSTEM FOR SELECTIVE EXAMINATIONS
Akihiro Hashimoto（University of Tsukuba） |
A NOTE ON THE RESPONSE TIME IN M/G/1 QUEUES WITH SERVICE IN RANDOM ORDER AND BERNOULLI FEEDBACK
Hideaki Takagi（The University of Tsukuba） |
A SEARCH GAME FOR A MOBILE TARGET WITH THE CONDITIONALLY DETERMINISTIC MOTION DEFINED BY PATHS
Koji Iida, Ryusuke Hohzaki, Shingo Furui（The National Defense Academy） |
超楕円関数に基づくファジィロバスト回帰分析
藪内 賢之，和多田 淳三（大阪工業大学） |
TAIL BEHAVIOR OF THE STEADY-STATE DISTRIBUTION IN TWO-STAGE TANDEM QUEUES:NUMERICAL EXPERIMENT AND CONJECTURE
Kou Fujimoto, Yukio Takahashi（Tokyo Institute of Technology） |
LOCAL AND SUPERLINEAR CONVERGENCE OF STRUCTURED QUASI-NEWTON METHODS FOR NONLINEAR OPTIMIZATION
Hiroshi Yabe（Science University of Tokyo），Naokazu Yamaki（Research Institute of Systems Planning,Inc.） |
THE MINIMUM-WEIGHT IDEAL PROBLEM FOR SIGNED POSETS
Kazutoshi Ando, Satoru Fujishige（University of Tsukuba），Toshio Nemoto（Bunkyo University） |
2次コスト多品種流問題に対する並列型主双対内点法
山川 栄樹（高松大学），松原 康博（西日本旅客鉄道），福島 雅夫（京都大学） |
MARKOV DECISION PROCESSES WITH RANDOM HORIZON
Tetsuo Iida, Masao Mori（Tokyo Institute of Technology） |
A SIMPLE CHARACTERIZATION OF RETURNS TO SCALE IN DEA
Kaoru Tone（Saitama University） |
FEASIBLE REGION REDUCTION CUTS FOR THE SIMPLE PLANT LOCATION PROBLEM
Young-Soo Myung（Dankook University），Dong-wan Tcha（Korea Advanced Institute of Science and Technology） |
▲ |
