This paper addresses the trade-off challenge from reducing either the mean or variance of flow time when using simple sequencing rules in balanced, multi-class, serial queues. Study results show that instead of the expected zero sum situation, a balance between the two objectives can be achieved by assigning different priority rules to different queues. The order of priority rule assignments in different queues is shown to be relevant because variability along the line creates unbalanced queue lengths for each station, depending on the characteristics of the line. Thus, it was found that a simple heuristic for reducing both the mean and the variance of flow time in non-heavy traffic environments is to assign the first queue a priority rule ...
The paper we present here introduces a new priority mechanism in discrete-time queueing systems. It ...
The paper applies permutations of six dispatching rules to a two-machine dynamic flow shop operating...
Motivated by a factory scheduling problem, we consider the problem of input control (subject to a sp...
This paper addresses the trade-off challenge from reducing either the mean or variance of flow time ...
[[abstract]]A new adaptive rule for balancing the load on many parallel queues is designed. The queu...
Relative priorities in an n-class queueing system can reduce server and customer costs. This propert...
This paper focuses the hybrid flow shop scheduling problem with explicit and sequence-independent se...
This article addresses the problem of dynamic sequencing on n identical parallel machines with stoch...
Scheduling policies adopted for statistical multiplexing should provide delay differentiation betwee...
We are interested in queues in which customers of different classes arrive to a service facility, an...
A well-known problem with priority policies is starvation of delay-tolerant traffic. Additionally, i...
This simulation study investigated the effect on mean flow time and makespan of localized scheduling...
The Multi Priority Dual Queue (MPDQ) is a new scheduling regime shown to reduce congestion for multi...
The Multi Priority Dual Queue (MPDQ) is a new scheduling regime shown to reduce congestion for multi...
This paper deals with the design of priority rules for job shops that process multi-level assembly j...
The paper we present here introduces a new priority mechanism in discrete-time queueing systems. It ...
The paper applies permutations of six dispatching rules to a two-machine dynamic flow shop operating...
Motivated by a factory scheduling problem, we consider the problem of input control (subject to a sp...
This paper addresses the trade-off challenge from reducing either the mean or variance of flow time ...
[[abstract]]A new adaptive rule for balancing the load on many parallel queues is designed. The queu...
Relative priorities in an n-class queueing system can reduce server and customer costs. This propert...
This paper focuses the hybrid flow shop scheduling problem with explicit and sequence-independent se...
This article addresses the problem of dynamic sequencing on n identical parallel machines with stoch...
Scheduling policies adopted for statistical multiplexing should provide delay differentiation betwee...
We are interested in queues in which customers of different classes arrive to a service facility, an...
A well-known problem with priority policies is starvation of delay-tolerant traffic. Additionally, i...
This simulation study investigated the effect on mean flow time and makespan of localized scheduling...
The Multi Priority Dual Queue (MPDQ) is a new scheduling regime shown to reduce congestion for multi...
The Multi Priority Dual Queue (MPDQ) is a new scheduling regime shown to reduce congestion for multi...
This paper deals with the design of priority rules for job shops that process multi-level assembly j...
The paper we present here introduces a new priority mechanism in discrete-time queueing systems. It ...
The paper applies permutations of six dispatching rules to a two-machine dynamic flow shop operating...
Motivated by a factory scheduling problem, we consider the problem of input control (subject to a sp...