the share of dc-based renewable energy resources (rers) and electricity storage systems are increasing due to developments of smart grid technologies. moreover, the share of dc-based load has rapid growth due to significant developments of power electronic technologies. therefore, a more flexible power system is required for efficient integration of emerging loads and generators. in this paper,...

The general flowshop scheduling problem is a production problem where a set of n jobs have to be processed with identical flow pattern on m machines. In permutation flowshops the sequence of jobs is the same on all machines. A significant research effort has been devoted for sequencing jobs in a flowshop minimizing the makespan. This paper describes the application of a Constructive Genetic Alg...

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

 The m-machine no-wait flowshop scheduling problem is addressed by taking into account two performance measures of makespan and mean completion time. The objective is to minimize makespan such that mean completion time is less than a certain value. A dominance relation is provided for a special case of the problem. Moreover, two new heuristics are proposed in this paper. Computational analysis...

A great deal of work has been done to analyze the problem of robot move sequencing and part scheduling in robotic cell flowshops. We examine the recent developments in this literature. A robotic cell flowshop consists of a number of processing stages served by one or more robots. Each stage has one or more machines that perform that stage’s processing. Types of robotic cells are differentiated ...

The problem of scheduling in permutation flowshops has been extensively investigated by many researchers. Recently, attempts are being made to consider more than one objective simultaneously and develop algorithms to obtain a set of Pareto-optimal solutions. Varadharajan et al. (2005) presented a multi-objective simulated-annealing algorithm (MOSA) for the problem of permutation-flowshop schedu...

An implementation of a genetic algorithm for the n/m/P/Cmax sequencing problem is presented, and two performance enhancements hybridisation with a local search algorithm, and a `string fridge` are evaluated. This implementation is then extended to allow the genetic algorithm to optimise the placement of additional processing units to enhance productivity, and to meet order deadlines. Finally, p...

The viability of many heuristic procedures strongly depends on the adequate adjustment of parameters. This work presents an adjustment procedure which was applied to a Genetic Algorithm. First, a preliminary analysis is performed, intended to obtain a better understanding of the behavior of the parameters, as for example to estimate how likely it is for the preceding adjustment of the parameter...