巻号一覧
13 巻, 4 号
選択された号の論文の6件中1～6を表示しています
- |<
- <
- 1
- >
- >|
-
貝原 俊也2000 年 13 巻 4 号 p. 159-167
発行日: 2000/04/15
公開日: 2011/10/13
ジャーナル フリーNowadays it is not enough to supply products based on customer's preference, and both manufactures and distributors must have excellent order fulfillment. Leading manufactures and distributors are closely managing their suppliers in order to improve the fulfillment. Market mechanism solves the product distribution problem by allocating the scheduled resources according to market prices. In this paper a new concept based on market-oriented programming with various utilities of agents is introduced so as to facilitate Pareto-optimal products allocation amongst various business units in distribution system. Simulation results indicate the effectiveness of the proposed algorithm and detect further research subjects.抄録全体を表示PDF形式でダウンロード (1212K) -
白石 善明, 白河 芳徳, 太田 能, 曽根 直人, 森井 昌克2000 年 13 巻 4 号 p. 168-178
発行日: 2000/04/15
公開日: 2011/10/13
ジャーナル フリーIn the Internet, the IXP (Internet Exchange Point) /s tend to be congested since all traffic must go through the IXP's if the ISP (Internet Service Provider) 's belong to the different upper ISP's. In particular, this problem is serious in Japan since we have only a few IXP's. To ease this problem, we focus on the HTTP traffic exchanged among the neighboring ISP's since the web browsing causes major traffic in the Internet. In this paper, we provide a structure of regional HTTP-IXP and its experimental results. Our HTTP-IXP system aims to reduce the backborn traffic with comparatively low cost by exchanging the regional HTTP traffic via HTTP cash server. Our experimental results show that the backborn traffic can be reduced without the degradation of any user QoS (Quality of Service).抄録全体を表示PDF形式でダウンロード (1311K) -
尹 禮分, 中山 弘隆, 谷野 哲三, 荒川 雅生2000 年 13 巻 4 号 p. 179-185
発行日: 2000/04/15
公開日: 2011/10/13
ジャーナル フリーIn this paper, a method using generalized data envelopment analysis and genetic algorithms is proposed for finding efficient frontiers in multi-objective optimization problems. The proposed method can yield desirable efficient frontiers even in nonconvex cases. It will be proved that the proposed method overcomes shortcomings of existing methods through several numerical examples.抄録全体を表示PDF形式でダウンロード (779K) -
杉山 正治, 秋下 貞夫2000 年 13 巻 4 号 p. 186-193
発行日: 2000/04/15
公開日: 2011/10/13
ジャーナル フリーThis paper discusses Three Dimensional (3D; 2D in space and 1D in time) trajectories synthesis algorithms for future air traffic control automation. In order to prepare the computerized air traffic automation systems that assist human controller, highly complicated time optimal problem should be investigated in non-linear control systems. First, synthesis of the plural trajectories with constant speed is discussed aiming to substitute for human controller that plans simultaneously trajectories of eight aircraft at most. Second, synthesis of the plural trajectories with variable speed for eight aircraft is discussed.抄録全体を表示PDF形式でダウンロード (1059K) -
梅田 豊裕, 小西 正躬, 北村 章, 金村 真三, 高見 真司2000 年 13 巻 4 号 p. 194-203
発行日: 2000/04/15
公開日: 2011/10/13
ジャーナル フリーIn this paper, we describe a scheduling algorithm for berth assignment of shipment in iron and steel works. In the berth scheduling we discuss here, it is necessary to consider both minimization of the waiting-time of shipment for each ship and maximization of the efficiency of work in each berth. To determine the optimal combination between berths and ships, and the optimal order of shipment, we develop an algorithm based on branch and bound method. To improve the efficiency of optimal solution search in this algorithm, we introduce an estimation term of cost-increase for unallocated ships in the evaluation function structure, and use a heuristic search in determination of an initial solution. Moreover, to apply to a larger problem, we also use a practical solving method for divided search space. By using this algorithm, the scheduling system can provide a useful planning result of daily berth assignment within practicable time.抄録全体を表示PDF形式でダウンロード (1398K) -
諏訪 晴彦, 淺田 克暢, 三道 弘明2000 年 13 巻 4 号 p. 204-211
発行日: 2000/04/15
公開日: 2011/10/13
ジャーナル フリーThis paper proposes a mathematical model of an optimal periodic schedule revision policy for jobshop scheduling where we detect delays of tasks and perform a periodic schedule revision at iT/M (i= 1, 2, …, M) for a schedule period T. We first overview the jobshop scheduling and then investigate the property of schedule delays. The long-run average cost per unit time of the schedule revision policy is, secondly, formulated under the assumption that the number N (t) of delayed tasks occurring over (0, t] follows a non-homogeneous Poisson process with mean value function H (t) . It is shown that there always exists a finite frequency M* minimizing the long-run average cost. Through computational experiments, finally, we discuss the characteristics of the proposed policy and its applicability to jobshop scheduling problems.抄録全体を表示PDF形式でダウンロード (974K)
- |<
- <
- 1
- >
- >|