In this paper, we have studied a multiobjective hybrid flowshop scheduling problem where n independent jobs should be executed in a hybrid assembly line. The aim of our work is to optimize the makespan and the total tardiness of the whole production. A simulation based optimization algorithm is proposed here to solve this problem. It is a combination of the simulation software ARENA and the FLC...

Scheduling in chemical flowshops is one of a number of important industrial problems which are potentially amenable to solution using the genetic algorithm. However the problem is not trivial: flowshops run continuously, and for efficient operation those controlling them must be able to adjust the order in which products are made as new requests are received. In addition, there are in principle...

Solving efficiently complex problems using metaheuristics, and in particular local search algorithms, requires incorporating knowledge about the problem to solve. In this paper, the permutation flowshop problem is studied. It is well known that in such problems, several solutions may have the same fitness value. As this neutrality property is an important issue, it should be taken into account ...

The hybrid or flexible flowshop problem is a generalization of the flowshop in such a way that every job can be processed by one among several machines on each machine stage. In recent years a number of effective exact methods have been developed. A major reason for this progress is the development of new job and machine based lower bounds as well as the rapidly increasing importance of constra...

This paper deals with a flowshop scheduling problem with a special blocking RCb (Release when Completing Blocking). In some industrial environments, such flexible production systems can be encountered. Genetic algorithms are good methods to solve these problems. A method is proposed to further improve solutions already found by genetic algorithms. It consists in marking out recurrent genes asso...

In this paper a new metaheuristic method is proposed to solve the classical permutation flowshop scheduling problem with the objective of minimizing sum of completion times. The representative neighbourhood combines the stochastic sampling method mainly used in Simulated Annealing and the best descent method elaborated in Tabu Search and integrates them naturally into a single method. The metho...

The paper considers the problem of preemptive scheduling in a two-stage flowshop with parallel unrelated machines at the first stage and a single machine at the second stage. At the first stage, jobs use some additional renewable resources which are available in limited quantities. The resource requirements are of 0-1 type. The objective is minimization of the makespan. The problem is NP-hard. ...

Flowshop scheduling deals with the sequencing of a set of jobs that visit a set of machines in the same order. A tabu search procedure is proposed for the flowshop scheduling problem with the makespan minimization criterion. Different from other tabu search procedures, the neighborhood of a solution is generated using a combination of three different exchange mechanisms. This has resulted in a ...