Queuing systems with time-critical customers can be encountered in packetized voice-communication systems, automated command and control systems and manufacturing systems with time-critical jobs among others. We consider the following model for these systems. Customers arriving at the system have individual deadlines and they must reach their destination by their extinction time or due time (arrival time plus deadline). A penalty is incurred otherwise and this implies either the complete loss of customer or another form of tardiness cost. We are interested in characterizing the strategy (of scheduling the customers bearing the label of their deadlines) which minimizes a cost function that reflects the nature of the penalty incurred. We firs...
In this thesis, we study different scheduling policies in service networks. In Chapter 2, we conside...
In this dissertation, we study the impact of efficient resource allocation policies on the performan...
Optimization of scheduled arrival times to an appointment system is approached from the perspectives...
We consider the problem of dynamic scheduling of customers (messages) in time-critical environments....
Abstract. Many problems can be modeled as single-server queues with impatient customers. An example ...
Queueing networks are extensively used in the study of systems such as communication, computer, and ...
International audienceWe consider a single server queue in discrete time, in which customers must be...
International audienceWe consider a single-server queue in discrete time, in which customers must be...
International audienceWe consider a single server queue in discrete time, in which customers must be...
Time constrained communications, such as packetized voice, differs from data communications in two i...
Working paper. Ecole Centrale Paris (LGI) and Vrije Universiteit (Department of Mathematics)We consi...
Real-time scheduling, or scheduling with respect to a deadline, is critical in many application area...
We consider the problem of how best to assign the service effort in a queueing network in order to m...
A well-known problem with priority policies is starvation of delay-tolerant traffic. Additionally, i...
We study a canonical real-time scheduling problem for time-slotted collocated wireless networks serv...
In this thesis, we study different scheduling policies in service networks. In Chapter 2, we conside...
In this dissertation, we study the impact of efficient resource allocation policies on the performan...
Optimization of scheduled arrival times to an appointment system is approached from the perspectives...
We consider the problem of dynamic scheduling of customers (messages) in time-critical environments....
Abstract. Many problems can be modeled as single-server queues with impatient customers. An example ...
Queueing networks are extensively used in the study of systems such as communication, computer, and ...
International audienceWe consider a single server queue in discrete time, in which customers must be...
International audienceWe consider a single-server queue in discrete time, in which customers must be...
International audienceWe consider a single server queue in discrete time, in which customers must be...
Time constrained communications, such as packetized voice, differs from data communications in two i...
Working paper. Ecole Centrale Paris (LGI) and Vrije Universiteit (Department of Mathematics)We consi...
Real-time scheduling, or scheduling with respect to a deadline, is critical in many application area...
We consider the problem of how best to assign the service effort in a queueing network in order to m...
A well-known problem with priority policies is starvation of delay-tolerant traffic. Additionally, i...
We study a canonical real-time scheduling problem for time-slotted collocated wireless networks serv...
In this thesis, we study different scheduling policies in service networks. In Chapter 2, we conside...
In this dissertation, we study the impact of efficient resource allocation policies on the performan...
Optimization of scheduled arrival times to an appointment system is approached from the perspectives...