This work addresses opportunistic distributed multiuser scheduling in the presence of a fixed packet deadline delay constraint. A threshold-based scheduling scheme is proposed which uses the instantaneous channel gain and buffering time of the individual packets to schedule a group of users simultaneously in order to minimize the average system energy consumption while fulfilling the deadline d...

We develop a sequential clinical scheduling method for patients with general service time distributions. Patients are scheduled during a call-in period that precedes the scheduled consultation session. The session is divided into a set of time intervals called “slots”. When a patient calls, the scheduler assigns the patient to a suitable slot if one exists. Each scheduled patient has a probabil...

Orthogonal Frequency Division Multiplexing (OFDM) with dynamic scheduling and resource allocation is a key component of most emerging broadband wireless access networks such as WiMAX and Long Term Evolution (LTE). Resource allocation mechanisms in LTE are very critical issues, because scheduling algorithms have the main responsibility for determining how to allocate radio resources for differen...

This paper presents using policy tree and estimation of distribution algorithms (EDAs) to solve resource-constrained project scheduling problem (RCPSP) with considering rework with probability. Firstly, the algorithm adopts policy tree to model the project scheduling problem, which contains decision variables, stochastic variables and precedence relations, trying to make proactive scheduling an...

Scheduling concerns about the effective allocation of limited resources over time. For the last two decades, many scheduling systems have been designed and developed for various applications in manufacturing, transportation and project management. As the complexity of the scheduling problem is getting more and more complicated, the development of scaleable and configurable systems become essent...

This paper addresses the following scheduling problem in wireless packet switched networks: Given that only coarse-grained channel state information is available, how to design a robust scheduler that ensures worst-case optimal performance? To solve this problem, we take a zero-sum game theoretic approach, in which the scheduler and the channel error act as non-cooperative adversaries in the sc...

To deliver high performance in power limited systems, architects have turned to using heterogeneous systems, either CPU+GPU or mixed CPU-hardware systems. However, in systems with different processor types and task affinities, scheduling tasks becomes more challenging than in homogeneous multi-core systems or systems without task affinities. The problem is even more complex when specialized acc...

Value-based approaches have been used in the real-time scheduling context, especially for so-called anytime applications. Scheduling methodologies for signal processing or similar dataflow-related applications, however, frequently rely on constraint solving techniques like linear programming and on static schemes. For soft and firm real-time applications with precedence constraints and uncertai...

Proper scheduling of tasks leads to optimum using of time and resources, in order to obtaining best result. One of the most important and complicated scheduling problems is open shop scheduling problem. There are n jobs in open shop scheduling problem which should be processed by m machines. Purpose of scheduling open shop problem is attaining to a suitable order of processing jobs by specified...