The flexible flow-shop group scheduling problem is investigated in this paper to minimize the makespan. Two algorithms have been proposed to solve the problem with two machine centers, which have the same number of parallel machines. The first one is a heuristic algorithm. It first determines the sequence of jobs in each group by Sriskandarajah and Sethi’s approach of solving the flexible flow-...

Considering the standard particle swarm optimization (PSO) has the shortcomings of low convergence precision in job shop scheduling problems, the job shop scheduling solution is presented based on improved particle swarm optimization (A-PSO). In this paper, the basic theory of A-PSO is described. Also, the coding and the selection of parameters as well as the decoding of A-PSO are studied. It u...

This paper breaks new ground by modelling lot sizing and scheduling in a flexible flow line (FFL) simultaneously instead of separately. This problem, called the ‘General Lot sizing and Scheduling Problem in a Flexible Flow Line’ (GLSP-FFL), optimizes the lot sizing and scheduling of multiple products at multiple stages, each stage having multiple machines in parallel. The objective is to satisf...

— Flexible Job Shop scheduling problem (FJSSP) is an important scheduling problem which has received considerable importance in the manufacturing domain. In this paper a genetic algorithm (GA) based scheduler is presented for flexible job shop problem to minimise makespan. The proposed approach implements a domain independent GA to solve this important class of problem. The scheduler is impleme...

The Flexible Job Shop scheduling Problem (FJSP) is a generalization of the classical Job Shop Problem in which each operation must be processed on a given machine chosen among a finite subset of candidate machines. The aim is to find an allocation for each operation and to define the sequence of operations on each machine so that the resulting schedule has a minimal completion time. We propose ...

this paper presents a new mathematical model for a hybrid flow shop scheduling problem with multiprocessor tasks in which sequence dependent set up times and preemption are considered. the objective is to minimize the weighted sum of makespan and maximum tardiness. three meta-heuristic methods based on genetic algorithm (ga), imperialist competitive algorithm (ica) and a hybrid approach of ga a...

We present Bar Systems: a family of very simple algorithms for different classes of complex optimization problems in static and dynamic environments by means of reactive multi agent systems. Bar Systems are in the same line as other Swarm Intelligence algorithms; they are loosely inspired in the behavior a staff of bartenders can show while serving drinks to a crowd of customers in a bar or pub...

The proposed hybrid stage shop scheduling (HSSS) model, inspired from a real case in the high-fashion industry, aims to fully exploit the potential of parallel resources, splitting and overlapping concurrent operations among teams of multifunctional machines and operators on the same job. The HSSS formally extends mixed shop scheduling (a combination of flowshop and open shop), which is able to...

In this paper, we propose 260 scheduling problems whose size is greater than that of the rare examples published. Such sizes correspond to real dimensions of industrial problems. The types of problems that we propose are : the permutation flow shop, the job shop and the open shop scheduling problems. We restrict us to basic problems : the processing times are fixed, there are neither set-up tim...

In traditional scheduling literature, it is generally assumed that the location of facilities are predetermined and fixed in advance. However, these decisions are interrelated and may impact each other significantly. Therefore finding a schedule and facility location has become an important problem as an extension of the well-known scheduling problems. In this research we consider joint decisio...