Branch-and-bound (B&B) is a well-known and general combinatorial optimisation technique that is used especially for NP-hard problems where no special purpose algorithm is known. Because of the high problem complexity, parallel implementations are required for speeding up the computations. Algorithms with high and stable efficiency, i.e., utilisation of the processing elements (PEs), are desired...

In this paper, we propose a scheme to save power during the execution of backoff algorithm by avoiding idle listening. Existing MAC protocols for sensor networks reduces energy consumption by introducing an active/sleep duty cycle. But they can’t save energy during the execution of backoff algorithm. The propose scheme could further improve the energy efficiency of senor networks MAC protocols....

In this paper, we examine the utility of exploiting idle memory in workstation pools. We attempt to answer the following questions. First, given a workstation pool, what fraction of the memory can be expected to be idle? This provides an estimate of the opportunity for hosting guest data. Second, what fraction of a individual host' s memory can be expected to be idle? This helps determine the r...

The ability to define in-field tractor load states offers the potential to better specify and characterize fuel consumption rate for various field operations. For the same field operation, the tractor experiences diverse load demands and corresponding fuel use rates as it maneuvers through straight passes, turns, suspended operation for adjustments, repair and maintenance, and biomass or other ...

In shop scheduling, several applications exist where it is required that some components perform consecutively. We refer to no-idle schedules if machines are required to operate with no inserted idle time and no-wait schedules if tasks cannot wait between the end of an operation and the start of the following one. We consider here no-idle/no-wait shop scheduling problems with makespan as perfor...