This paper presents the optimal scheduling in a single machine by considering idle insert. The objective function is to minimize the sum of maximum earliness and tardiness. This scheduling problem can be applied in different production systems such as just in time (JIT) systems. Special case of common due date is presented and the associated optimal solution is reported. In general case of a si...

The decreasing cost of personal workstations over recent years has led to their proliferation in computing environments. Studies have shown that personal workstations are under-utilized for long periods of time during regular working hours. This paper identiies this under-utilization as the idle-workstation problem. A taxonomy of computational models of systems that have attempted to solve the ...

Heavy industry maintenance facilities at aircraft service centers or railroad yards must contend with scheduling preventive maintenance tasks to ensure critical equipment remains available. The workforce that performs these tasks are often high-paid, which means the task scheduling should minimize worker idle time. Idle time can always be minimized by reducing the workforce. However, all preven...

The expected wait in the Gi/G/1 queue is related to the mean and variance of the idle time. For arrival distributions which are 1FR or have mean residual life bounded by r-, simple bounds are obtained which A. give, for example, the expected number in queue to within at most one customer. By equating input with output, relations between random variables are used to obtain expressions foi the mo...

This study examined the prevalence and incidence of abnormal behaviour in sheep housed individually indoors. Ninety-six castrated Merino sheep were observed using 15-min instantaneous sampling between 08:15 and 18:15 h for two consecutive days over a 3-week period. Sheep on average spent 62% of their time idle, 17% feeding, 1% drinking, 5% pacing, 10% chewing pen fixtures and 4% nosing pen fixt...

The max / / C idle no F − problem is solved by a branch and bound algorithm, or a mixed integer programming solver. This problem is known to be NP-hard. The noidle flow-shop configuration, where machines work continuously without idle intervals is an interesting manufacturing environment in many industries. The idle characteristic is a very strong constraint and it affects seriously the value o...

This paper proposes eecient scheduling algorithms for the joint scheduling of hard aperiodic, sporadic and periodic real time tasks, in systems based on preemptive, xed-priority dispatching. Our scheme guarantees or rejects hard aperiodic real time tasks without any prior knowledge of their attributes, by managing the idle processor capacity dynamically. The method assigns xed priorities to per...

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...