In this paper, we present a deterministic permutation flowshop scheduling problem with new objective function, the total core idle time. The interest of is related to reduce energy consumption system, taking into account that needed during processing times constant, and machines are switched off front back times. Therefore, dependent on time where in stand-by mode, i.e between jobs, named as Co...

Inserted idle time occurs when a machine is kept waiting deliberately for the arrival of a job that is still being processed on a preceding machine. A common assumption in most of the existing literature on flowshop scheduling is that inserted idle time is not allowed, and whenever there are jobs that are ready for processing on a given machine, that machine is not kept idle for any reason. Thi...

• Decision epochs are the beginning of every period. • Action space includes Keep (K), Release & Work (RW), Release & Idle (RI) and Idle (I) for each server. The 16 unique combinations of the two workers’ actions constitute the system’s action space. Action “Keep” requires the worker to continue working on the current job for one more period. Action “Release & Work” requires that the worker sto...

spend much of their time idle, and various schemes have been proposed to use this idle time productively. We have used this approach to improve overall performance in storage systems. The most common approach is to off-load activity from busy periods to less-busy ones in order to improve system responsiveness. In addition, speculative work can be performed in idle periods in the hope that it wi...

An open queueing network model in light traffic has been developed. The theorem on the law of the iterated logarithm for the idle time process of customers in an open queueing network has been presented. Finally, we present an application of the theorem a idle time model from computer network practice. Key–Words: mathematical models of technical systems, reliability theory, queueing theory, ope...