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

A recent interesting paper ~Cooper, Niu, and Srinivasan @2# ! shows how for some cyclic production systems reducing setup times can surprisingly increase work in process+ There the authors show how in these situations the introduction of forced idle time can be used to optimize system performance+ Here we show that introducing forced idle time at different points during the production cycle can...

This paper represents linkage network of queues consisting of biserial and parallel servers linked to a common server in series with a flowshop scheduling system consisting of two machines. The significant transportation time of the jobs from one machine to another is also considered. Further, the completion time of jobs/customers (waiting time + service time) in the queue network is the set...

Generally, there are periodic interrupt services in the real-time embedded systems even when the system is in the idle state such as the periodic clock tick interrupts. To minimize the idle power, power management therefore should consider the effect of periodic interrupt services. In this paper, we deal with this problem considering two scenarios. In case the periodic interrupt cannot be disab...