Many sensor network applications feature correlated traffic bursts: after a period of idle time with almost no network traffic, many nodes have to transmit large amounts of data simultaneously. One example is volcano monitoring [17], where rare eruptions trigger many nodes simultaneously to transmit seismic data traces. For such applications, a MAC protocol should exhibit a low overhead both in...

Hot ring rolling is a highly nonlinear, unsteady-state and asymmetry process which is affected by many parameters. The friction coefficient between the ring ,the driver roll and the idle roll is one of the problems, which has significant effect on the quality of final product. In this study, the effect of these two parameters on hot ring rolling was investigated based on a 3D coupled-thermo mec...

in this paper the real time operation of an automatic teller machine (atm) is analyzed using atimed petri net (tpn) model. in the modeling, the probability of arrivals, the speed andattentiveness of customers (clients) are taken to account. different parameters are based onthe statistical data. the model is simulated for 24 hours. the diagrams of number ofsucceeded customers, failed references ...

Flow shop scheduling problem has a wide application in the manufacturing and has attracted much attention in academic fields. From other point, on time delivery of products and services is a major necessity of companies’ todays; early and tardy delivery times will result additional cost such as holding or penalty costs.  In this paper, just-in-time (JIT) flow shop scheduling problem with preemp...

The paper is designated to the analysis of queueing systems, arising in the network theory and communications theory (called multiphase queueing systems, tandem queues or series of queueing systems). Also we note that multiphase queueing systems can be useful for modelling practical multi-stage service systems in a variety of disciplines, especially on manufacturing (assembly lines), computer n...

Though existing systems for sharing distributed resources in clusters of workstations are generally e ective at recruiting idle resources, these systems often have a disruptive e ect on desktop workstation users. Even when recruiting computing cycles from strictly idle workstations, a by-product of running foreign jobs is that the virtual memory pages of the original user's idle processes are u...

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