Survey on the idle capacity of fish processing (freezing) plants in India - 1. West Coast

The extent of idle capacity in fish processing (freezing) plants estimated by stratified random sampling is reported. The estimates for 1978 and 1979 for the processing plants on the west coast of India were 76.9 % and 73.2 % respectively at the rate of 250 working days per annum and two shifts per day. The percentage error of estimates worked out to 6.04 for 1978 and 6.98 for 1979. Substantial under utilization of processing plants noticed in all the states accounts mainly to the non-availability of raw material (prawn), high cost of production and shortage of power.

Survey on the idle capacity of fish processing (freezing) plants in India - 2. East coast

The extent of idle capacity in the fish processing (freezing) plants in the east coast of India estimated by stratified random sampling and the factors responsible for the same are reported. The estimates of idle capacity of fish processing plants in the east coast for the years 1978 and 1979 were respectively 75.9% and 72.5% on the basis of 250 working days per annum and double shift per day. The percentage errors of estimates worked out to 6.9 for 1978 and 4.7 for 1979. The corresponding figures were worked out on the basis of 200 working days also. Substantial under-utilisation of plants in all the maritime states in the east coast accounted mainly to non-availability of raw material, high cost of production, shortage of power, scarcity of ice and potable water during peak season and frequent labour troubles.

Markovian bulk-arriving queues with state-dependent control at idle time

This paper considers a Markovian bulk-arriving queue modified to allow both mass arrivals when the queue is idle and mass departures which allow for the possibility of removing the entire workload. Properties of queues which terminate when the server becomes idle are developed first, since these play a key role in later developments. Results for the case of mass arrivals, but no mass annihilation, are then constructed with specific attention being paid to recurrence properties, equilibrium queue-size structure, and waiting-time distribution. A closed-form expression for the expected queue size and its Laplace transform are also established. All of these results are then generalised to allow for the removal of the entire workload, with closed-form expressions being developed for the equilibrium size and waiting-time distributions.

Assessing the Potential for Saving Energy by Impersonating Idle Networked Devices

The idea of proxying network connectivity has been proposed as an efficient mechanism to maintain network presence on behalf of idle devices, so that they can “sleep”. The concept has been around for many years; alternative architectural solutions have been proposed to implement it, which lead to different considerations about capability, effectiveness and energy efficiency. However, there is neither a clear understanding of the potential for energy saving nor a detailed performance comparison among the different proxy architectures. In this paper, we estimate the potential energy saving achievable by different architectural solutions for proxying network connectivity. Our work considers the trade-off between the saving achievable by putting idle devices to sleep and the additional power consumption to run the proxy. Our analysis encompasses a broad range of alternatives, taking into consideration both implementations already available in the market and prototypes built for research purposes. We remark that the main value of our work is the estimation under realistic conditions, taking into consideration power measurements, usage profiles and proxying capabilities.

A new Nawaz–Enscore–Ham-based heuristic for permutation flow-shop problem with bicriteria of makespan and machine idle-time

A new heuristic based on Nawaz–Enscore–Ham (NEH) algorithm is proposed for solving permutation flowshop scheduling problem in this paper. A new priority rule is proposed by accounting for the average, mean absolute deviation, skewness and kurtosis, in order to fully describe the distribution style of processing times. A new tie-breaking rule is also introduced for achieving effective job insertion for the objective of minimizing both makespan and machine idle-time. Statistical tests illustrate better solution quality of the proposed algorithm, comparing to existing benchmark heuristics.