The optimization of energy consumption in the cloud computing environment is the question how to use various energy conservation strategies to efficiently allocate resources. The need of different resources in cloud environment is unpredictable. It is observed that load management in cloud is utmost needed in order to provide QOS. The jobs at over-loaded physical machine are shifted to under-lo...

assembly line production is one of the widely used basic principles in production system. the problem of assembly line balancing deals with the distribution of activities among the workstations so that there will be maximum utilization of human resources and facilities without disturbing the work sequence. research works reported in the literature mainly deals with minimization of idle time i.e...

Abstract: In machine job shops with automated guided vehicles (AGVs) as mean of transportation of job parts, it’s usually hard to determine the optimal fleet size of AGVs for achieving a desired performance. In this paper a heuristic AGV dispatching algorithm is constructed based on the concept of ideal pipeline and Petri Net theory to balance the job part scheduling and AGV dispatching that mi...

Persons with disabilities have severe problems participating in the job market and their unemployment rate is usually much higher than the average of the population. This motivates the research of new modes of production which allow the inclusion of these persons at a low overhead. In this paper we study the inclusion of persons with disabilities into flow shops with the objective of minimizing...

In this paper, we present a new hybrid optical burst switch architecture (HOBS) that takes advantage of the pre-transmission idle time during lightpath establishment. In dynamic circuit switching (wavelength routing) networks, capacity is immediately hardreserved upon the arrival of a setup message at a node, but it is used at least a round-trip time delay later. This waste of resources is sign...

We consider the problem of minimizing makespan in a no-wait flow-shop with an arbitrary number of machines. We assume that all sublots have the same number of items. We consider the cases with or without loading times. In both cases we show the existence of a critical machine which never remains idle. Then we get a set of general conditions on the processing times and loading times, which bind ...

This paper considers a scheduling problem in flexible flow shops environment with the aim of minimizing two important criteria including makespan and cumulative tardiness of jobs. Since the proposed problem is known as an Np-hard problem in literature, we have to develop a meta-heuristic to solve it. We considered general structure of Genetic Algorithm (GA) and developed a new version of that b...