The single machine scheduling problem is considered in which each task has a release dates, a processing time and a due date. The objective is to mimimize the maximum lateness. Preemption is not allowed. Scheduling problem 1|rj |Lmax is a NP-hard problem. We define an IIT (inserted idle time) schedule as a feasible schedule in which a processor is kept idle at a time when it could begin process...

NetWork is an experiment in distributed computing. The idea is to make use of idle time on personal workstations while retaining their advantages of immediate and guarantied availability. NetWork wants to make use of otherwise idle resources only. The performance criterion of NetWork is the net work done per unit time not computing time or other measures of resource utilization. The NetWork mod...

Traditionally, tolerance allocation and scheduling have been dealt with separately in the literature. The aim of tolerance allocation is to minimize the tolerance cost. When scheduling the sequence of product operations, the goal is to minimize the makespan, mean flow time, machine idle time, and machine idle time cost. Calculations of manufacturing costs derived separately using tolerance allo...

Many sensor network applications feature bursty traffic patterns: after long periods of idle time with almost no network traffic, large amounts of data have to be transmitted reliably and in a timely manner. One example is volcano monitoring [5], where precious high-volume data is generated by rare volcanic eruptions. Unfortunately, existing MAC protocols do not sufficiently support such applic...

This paper represents linkage network of queues consisting of biserial and parallel servers linked to a common server in series with a flowshop scheduling system consisting of two machines. The significant transportation time of the jobs from one machine to another is also considered. Further, the completion time of jobs/customers (waiting time + service time) in the queue network is the set...

With spectrum becoming an ever scarcer resource, it is critical that new communication systems utilize all the available frequency bands as efficiently as possible in time, frequency and spatial domain. rHowever, spectrum allocation policies most of the licensed spectrums grossly underutilized while the unlicensed spectrums are overcrowded. Hence, all future wireless communication devices beequ...

Generally, there are periodic interrupt services in the real-time embedded systems even when the system is in the idle state such as the periodic clock tick interrupts. To minimize the idle power, power management therefore should consider the effect of periodic interrupt services. In this paper, we deal with this problem considering two scenarios. In case the periodic interrupt cannot be disab...

We consider the problem of scheduling a partially ordered set of unit execution time (UET) tasks on m > 1 processors where there is a communication delay of unit time between any pair of distinct processors. We show that the problem of finding an optimal schedule is NP-hard. A greedy schedule is one where no processor remains idle if there is some task available which it c satisfies could proce...

Automated problem solving is viewed typically as the expenditure of computation to solve one or more problems passed to a reasoning system. In response to each problem received, e ort is applied to generate a solution and problem solving ends when the solution is rendered. We discuss the notion of continual computation that addresses a broader conception of problem by considering the ideal use ...