An Algorithm for the Parameters Determination of a Dynamic Priority Discipline in a Central Server Model

スポンサーリンク

概要

• 論文の詳細を見る

• This paper presents an algorithm to decide parameters of a dynamic priority discipline maximize an objective function and an algorithm for caluculating waiting time of jobs with a static priority discipline in a central server model. To show the effectiveness of the algorithm, we compare the mean waiting time results of the algorithm with that of simulation experiments. And also, we show the effectiveness of a dynamic priority discipline by comparing the objective function values of using FCFS and a static priority with that of using a dynamic priority discipline.

• 東海大学の論文

著者

• Koshiishi Katsuhiko

  Fujitsu Limited

• NOMURA Hiromitsu

  Department of Management Engineering

• HADA Takao

  Department of Management Engineering

関連論文

• An Algorithm for the Parameters Determination of a Dynamic Priority Discipline in a Central Server Model
• Approximate Solutions for Assembly Process Formation Problem in Aggregative Production System
• A Planning Method of Optical Fiber Cable Routing Based on Integer Programming(ABSTRACTS OF PROCEEDINGS OF THE SCHOOL OF INFORMATION TECHNOLOGY AND ELECTRONICS SERIES J TOKAI UNIVERSITY -2003-2004-)
• A Near-Optimal Solution for the Vehicle Routing Problem with Multiple Use of Vehicles(Production and Logistics)
• Approximate Algorithm For Group Technology Line Formation Problem(ABSTRACTS OF PROCEEDINGS OF THE SCHOOL OF INFORMATION TECHNOLOGY AND ELECTRONICS SERIES J TOKAI UNIVERSITY -2003-2004-)
• An Approximate Algorithm for the Resource Constrained Grouping Problem Based on the Lagrangian Relaxation Method

スポンサーリンク