Further results for dynamic scheduling of multiclass G/G/1 queues

1989 ◽  
Vol 26 (03) ◽  
pp. 595-603 ◽  
Author(s):  
Tetsuji Hirayama ◽  
Masaaki Kijima ◽  
Shoichi Nishimura
Keyword(s):  
Discrete Time ◽  
Dynamic Scheduling ◽  
Finite Horizon ◽  
Service Discipline ◽  
Scheduling Problems ◽  
Time Dynamic ◽  
Simple Index ◽  
Preemptive Resume ◽  
Index Policies ◽  
Holding Cost

We consider discrete-time dynamic scheduling problems of the following three types ofG/G/1 queue withKdifferent customer classes: (i) aG/DFR/1 queue withKclasses under preemptive resume service discipline, (ii) aG/IFR/1 queue with two classes under preemptive resume service discipline, and (iii) aG/G/1 queue with two classes under non-preemptive service discipline. Interchange arguments are used to show that simple index policies of different type minimize the total holding cost of customers in a finite-horizon scheduling period for the three cases. Our results extend the result for aG/M/1 queue by Buyukkoc et al. (1985) to general queues.

Further results for dynamic scheduling of multiclass G/G/1 queues

1989 ◽  
Vol 26 (3) ◽  
pp. 595-603 ◽  
Author(s):  
Tetsuji Hirayama ◽  
Masaaki Kijima ◽  
Shoichi Nishimura
Keyword(s):  
Discrete Time ◽  
Dynamic Scheduling ◽  
Finite Horizon ◽  
Service Discipline ◽  
Scheduling Problems ◽  
Time Dynamic ◽  
Simple Index ◽  
Preemptive Resume ◽  
Index Policies ◽  
Holding Cost

We consider discrete-time dynamic scheduling problems of the following three types of G/G/1 queue with K different customer classes: (i) a G/DFR/1 queue with K classes under preemptive resume service discipline, (ii) a G/IFR/1 queue with two classes under preemptive resume service discipline, and (iii) a G/G/1 queue with two classes under non-preemptive service discipline. Interchange arguments are used to show that simple index policies of different type minimize the total holding cost of customers in a finite-horizon scheduling period for the three cases. Our results extend the result for a G/M/1 queue by Buyukkoc et al. (1985) to general queues.

scholarly journals Search for a moving target in a competitive environment

2021 ◽  
Author(s):  
Benoit Duvocelle ◽  
János Flesch ◽  
Hui Min Shi ◽  
Dries Vermeulen
Keyword(s):  
Markov Chain ◽  
Discrete Time ◽  
Competitive Environment ◽  
Moving Target ◽  
Time Varying ◽  
Greedy Strategy ◽  
Time Dynamic ◽  
Dynamic Search ◽  
Subgame Perfect Equilibria ◽  
Perfect Equilibria

AbstractWe consider a discrete-time dynamic search game in which a number of players compete to find an invisible object that is moving according to a time-varying Markov chain. We examine the subgame perfect equilibria of these games. The main result of the paper is that the set of subgame perfect equilibria is exactly the set of greedy strategy profiles, i.e. those strategy profiles in which the players always choose an action that maximizes their probability of immediately finding the object. We discuss various variations and extensions of the model.

Dynamic Scheduling Model of Rail-Guided Vehicle (RGV) Based on Genetic Algorithms in the Context of Mobile Computing

2021 ◽  
Vol 12 (1) ◽  
pp. 43-62
Author(s):  
Chen Xu ◽  
Xueyan Xiong ◽  
Qianyi Du ◽  
Shudong Liu ◽  
Yipeng Li ◽  
...  
Keyword(s):  
Information System ◽  
Mobile Computing ◽  
Dynamic Scheduling ◽  
Distributed Processing ◽  
Processing System ◽  
Time Dynamic ◽  
Scheduling Model ◽  
Practical Operation ◽  
Optimization Efficiency ◽  
Production And Operation

Track guidance vehicle (RGV) is widely used in logistics warehousing and intelligent workshop, and its scheduling effectiveness will directly affect the production and operation efficiency of enterprises. In practical operation, central information system often lacks flexibility and timeliness. By contrast, mobile computing can balance the central information system and the distributed processing system, so that useful, accurate, and timely information can be provided to RGV. In order to optimize the RGV scheduling problem in uncertain environment, a genetic algorithm scheduling rule (GAM) using greedy algorithm as the genetic screening criterion is proposed in this paper. In the experiment, RGV scheduling of two-step processing in an intelligent workshop is selected as the research object. The experimental results show that the GAM model can carry out real-time dynamic programming, and the optimization efficiency is remarkable before a certain threshold.

Discrete-Time Robust Control of Linear Periodically Time-Varying Systems

2007 ◽  
Author(s):  
S. Kalender ◽  
H. Flashner
Keyword(s):  
Robust Control ◽  
Discrete Time ◽  
Robustness Analysis ◽  
Value Theory ◽  
Time Varying ◽  
Sampled Data ◽  
Point Mapping ◽  
Time Dynamic ◽  
Time Representation ◽  
Time Varying Systems

An approach for robust control of periodically time-varying systems is proposed. The approach combines the point-mapping formulation and a parameterization of the control vector to formulate an equivalent time-invariant discrete-time representation of the system. The discrete-time representation of the dynamic system allows for the application of known sampled-data control design methodologies. A perturbed, discrete-time dynamic model is formulated and plant parametric uncertainty are obtained using a truncated point-mapping algorithm. The error bounds due to point-mapping approximation are computed and a robustness analysis problem of the system due to parametric uncertainties is formulated using structured singular value theory. The proposed approach is illustrated by two design examples. Simulation studies show good performance robustness of the control system to parameter perturbations and system nonlinearities.

scholarly journals Discrete-Time Dynamic Image-Segmentation System

10.5772/14281 ◽  
2011 ◽  
Author(s):  
Kenichi Fujimoto ◽  
Mio Kobayashi ◽  
Tetsuya Yoshinag
Keyword(s):  
Image Segmentation ◽  
Discrete Time ◽  
Time Dynamic ◽  
Dynamic Image
Sign in / Sign up

Export Citation Format

Share Document