In this paper, we consider the problem of scheduling tasks on two dedicated processors where some tasks need to be processed only by the first processor and some others by the second processor; the remaining tasks, however, need both processors simultaneously. Tasks have release dates and have...

In this paper we introduce the Personnel Task Scheduling Problem (PTSP) and provide solution algorithms for a variant of this problem known as the Shift Minimisation Personnel Task Scheduling Problem (SMPTSP). The PTSP is a problem in which a set of tasks with fixed start and finish times have...

Task allocation and scheduling is an important typical problem in the area of high performance computing. Unfortunately, the existing traditional solutions to this problem in high performance computing cannot be directly implemented in wireless sensor networks (WSNs) due to the limitations of...

The purpose of this audit was to determine whether the fee calculation method proposed by Waste Management would result in an accurate and fair allocation of costs to both civilian and defense owners of nuclear waste. We reviewed Waste Management`s proposed cost allocation plans to be used in...

The multiprocessor scheduling problem with communication delays that we consider in this paper consists of finding a static schedule of an arbitrary task graph onto a homogeneous multiprocessor system, such that the total execution time (i.e. the time when all tasks are completed) is minimum....