We consider a single machine earliness/tardiness scheduling problem with general weights, ready times and due dates. Using completion time information obtained from the optimal solution to a preemptive relaxation, we generate feasible solutions to the original non-preemptive problem. We report extensive computational results demonstrating the speed and effectiveness of this approach.

Wireless sensor networks (WSNs) have a wide variety of military and civil applications. The sensor nodes are powered by batteries with limited energy. Hostile or hazardous environments where the sensor nodes are deployed or the sheer number of the sensors prevents replacement or recharge of the batteries. Therefore in WSNs, scheduling of different types of packets is of vital importance to redu...

A new scheduling formulation for data independent recursive algorithms is proposed. This formulation is intuitive and finds a static rate optimal schedules. Processing elements may be non-preemptive and non-homogenous. Comparisons with some other common scheduling methods to increase throughput is made.

Guaranteeing quality for differentiated services while ensuring resource efficiency is an important and yet challenging problem in large computing clusters. Priority scheduling is commonly adopted in production systems to minimize the response time of high-priority workload by means of preempting the execution of low-priority workload when faced with limited resources. As a result, the system p...

Traditional real-time systems are designed using preemptive scheduling and worst-case execution time estimates to guarantee the execution of high priority tasks. There is, however, an interest in exploring non-preemptive scheduling models for real-time systems, particularly for soft real-time multimedia applications. In this paper we propose a new algorithm that uses multiple scheduling strateg...

In this paper we consider a non-product form queueing model of a multiprocessor operating system. In order to improve upon model solution time over a discrete-event simulation and a Markov chain based approach, we propose an extension to the shadow technique to allow for any mixture of preemptive and non preemptive priority scheduling strategy combined with class switching. This new technique c...

We consider single processor preemptive scheduling with job-dependent setup times. In this model, a job-dependent setup time is incurred when a job is started for the first time, and each time it is restarted after preemption. This model is a common generalization of preemptive scheduling, and actually of non-preemptive scheduling as well. The objective is to minimize the sum of any general non...