Many safety-critical embedded systems are subject to certification requirements; some systems may be required to meet multiple sets of certification requirements, from different certification authorities. Certification requirements in such “mixed-criticality” systems give rise to some interesting scheduling problems, that cannot be satisfactorily addressed using techniques from conventional sch...

Preemptive scheduling is widespread in operating systems and in parallel processing on symmetric multiprocessors. However, in distributed systems it is practically unheard of. Scheduling in distributed systems is an important issue, and has performance impact on parallel processing, load balancing and metacomputing. Non-preemptive scheduling can perform well if the task lengths and processor sp...

Many scheduling problems contain uncertainty. In this paper, we address the uncertainty that arises from requests for appointments that arrive in real time. Requests must be assigned an appointment time immediately (i.e. before all requests are known) for service in the future. We propose dynamic template scheduling, a technique that combines proactive and online optimization and we apply it to...

For the last two decades, many interactive scheduling systems have been designed and developed for different scheduling applications. Due to the advent of information technology, scheduling systems with interactive, scaleable and reconfigurable support become one of the innovative approaches to tackle sophisticated scheduling problems. In this paper, first we describe the structure of an intera...

Liu and Layland discovered the famous utilization bound N(2 1 N − 1) for fixed-priority scheduling on singleprocessor systems in the 1970’s. Since then, it has been a long standing open problem to find fixed-priority scheduling algorithms with the same bound for multiprocessor systems. In this paper, we present a partitioning-based fixed-priority multiprocessor scheduling algorithm with Liu and...

Scheduling problems are found in a lot of application domains. Well known is the scheduling of production where manufacturing operations have to be assigned to limited resources like machines, but also other applications are important, e.g., the scheduling of airline crews, space missions, projects in different domains, clinical surgery, even timetabling and processor scheduling include schedul...

Scheduling concerns the allocation of limited resources to tasks over time and is pervasive and important in the management of industrial and government organizations. For the last two decades, interactive scheduling systems have become one of the most effective and efficient tools for real life scheduling applications. Due to the advent of information technology and client/server technology, d...

We consider several scheduling problems for packet based systems with time-varying channel conditions. Designing scheduling mechanisms that take advantage of time-varying channel conditions, which are different for different users, is necessary to improve system performance; however this has to be done in a way that provides some level of fairness among the users. Such scheduling mechanisms are...

the major problem of wind turbines is the great variability of wind power production. the dynamic change of the wind speed returns the quantity of the power injected to networks. therefore, wind–thermal generation scheduling problem plays a key role to implement clean power producers in a competitive environment. in deregulated power systems, the scheduling problem has various objectives than i...