Web based systems have been shown to be useful tools for supporting educational communication for teachers and students. In this paper we present such a system, which is an Integrated Distributed Learning Environment (IDLE). We present the technical description of this IDLE and we discuss its main characteristics like the transmission of multimedia data over the network, the manipulation of the...

In this paper we adopt the common cycle approach to economic lot scheduling problem and minimize the maximum aggregate inventory. We allow the occurrence of the idle times between any two consecutive products and consider limited capital for investment in inventory. We assume the setup times are negligible. To achieve the optimal investment in inventory we first find the idle times which minimi...

Lattice data structures are space efficient and cache-suitable data structures. The basic searching, insertion, and deletion operations are of time complexity O( √ N). We give a jump searching algorithm of time complexity O(J(L) log(N)), where J(L) is the jump factor of the lattice. J(L) approaches 4 when the degree of sortedness of the lattice approaches √ N . A sorting procedure of time compl...

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

Economic lot size scheduling problem (ELSP) for a multi-product single machine system is a classical problem. This paper considers ELSP with budgetary constraint as an important aspect of such systems. In the real world situations the available funds for investment in inventory is limited. By adopting the common cycle time approach to ELSP, we obtain the optimal common cycle which minimizes the...

in some industries as foundries, it is not technically feasible to interrupt a processor between jobs. this restriction gives rise to a scheduling problem called no-idle scheduling. this paper deals with scheduling of no-idle open shops to minimize maximum completion time of jobs, called makespan. the problem is first mathematically formulated by three different mixed integer linear programming...

Although both media commentary and academic research have focused much attention on the dilemma of employees being too busy, this paper presents evidence of the opposite phenomenon, in which employees do not have enough work to fill their time and are left with hours of meaningless idle time each week. We conducted six studies that examine the prevalence and work pacing consequences of involunt...

Processing and transmission of idle-time network traffic ideally only occurs when resources would have been idle in its absence. Proposed extensions to the Internet service model are similar to idle-time networking, but focus on network support. This paper investigates end-system extensions needed under such a service model. It introduces a simple model with two preempting prioritized traffic c...