Dynamic flexible job shop scheduling problems has been one of the important and strongly NP-hard problem of manufacturing systems for many years. Most of the proposed algorithms are based on priority rules; By using these rules, the arrived jobs go to a long queue of waited jobs and sometimes it takes a long time for a job to be processed. In this paper a new approach, integrating of priority r...

A Bernoulli schedule is random service discipline for a multi-class priority queueing system which operates as follows: If queue i(l :s i :s N) is not empty just after servicing a message in its queue, a message in queue i is served again with probability Pi, and the highest class message present in the system is served with probability 1-Pi, where 0 :s Pi :s 1. This paper presents an analysis ...

We show that certain twisting deformations of a family of supersolvable groups are simple as Hopf algebras. These groups are direct products of two generalized dihedral groups. Examples of this construction arise in dimensions 60 and pq, for prime numbers p, q with q|p − 1. We also show that certain twisting deformation of the symmetric group is simple as a Hopf algebra. On the other hand, we p...

Grid computing is the federation of pooling resources so as to solve large-scale problems. Scheduling is the main issue in grid computing and is the process of making scheduling decisions over multiple grid resources. In this paper, we propose a scheduling technique which classifies the subtasks based on the priority assigned by the user. This is mainly applicable in places where the high prior...

Size-based scheduling methods receive a lot of attention as they can greatly enhance the responsiveness perceived by the users. In effect, they give higher priority to small interactive flows which are the important ones for a good user experience. In this paper, we propose a new packet scheduling method, Early Flow Discard (EFD), which belongs to the family of Multi-Level Processor Sharing pol...

In this paper, we analyze a discrete-time GI-Geo-1 preemptive resume priority queue. We consider two classes of packets which have to be served, where one class has preemptive resume priority over the other. We show that the use of generating functions is beneficial for analyzing the system contents and packet delay of both classes. Moments and (approximate) tail probabilities of system content...

Recent trends toward multi-core architectures in real-time embedded systems pose challenges in designing efficient real-time multiprocessor scheduling algorithms. We believe that it is important to take into consideration both timing constraints of tasks (urgency) and parallelism restrictions of multiprocessor platforms (parallelism) together when designing scheduling algorithms. Motivated by t...

This paper presents priority-first packet scheduling approach for heterogeneous traffic flows in low data rate heterogeneous wireless sensor networks (HWSNs). A delay sensitive or emergency event occurrence demands the data delivery on the priority basis over regular monitoring sensing applications. In addition, handling sudden multi-event data and achieving their reliability requirements disti...

When there are different customer classes in a queue system, the j-th class customers have their services before j+1,j=1,2,… customers. Such queues named as with priority scheduling. In this study Markov system two is analyzed both under non-pre-emptive and nonpriority scheduling efficiency measures (the expected number of average waiting time system) obtained using Little’s Law. The criteria c...

This study presents a non-preemptive priority queue model to approximate the cell delay of a multi-channel slotted ring network with a single tunable transmitter and ®xed receiver, and one queue for storing cells for each channel at each node. To analyze network performance, this network is translated to the proposed non-preemptive priority queue model. With this model, the analytical cell-dela...