— 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 job shop scheduling problem is one of the most arduous combinatorial optimization problems. Flexible job shop scheduling problem (FJSP) is an important extension of the classical job shop scheduling problem, where the same operation could be processed on more than one machine. This paper proposed a new effective approach based on the hybridization of the particle swarm optimization (PSO) an...

This paper deals with scheduling of tasks in cyclic flexible job shop scheduling problem (CFJSSP). We have proposed a new method of computing cyclic time for CFJSSP. This method is based on the known properties of the job shop problem as well as new properties of cyclic scheduling. We have developed two versions of proposed method: sequential and parallel. The parallel version is dedicated to t...

Flexible manufacturing systems (FMSs) are nowadays installed in the mechanical industry. In such systems. many different part types are produced simultaneously and it is necessary to take tooling constraints into account for finding an optimal schedule. A heuristic method is presented for solving the m-machine, n-job shop scheduling problem with tooling constraints. This method. named TOMATO, i...

This paper presents a meta-heuristic algorithm for solving a job shop scheduling problem involving both sequence dependent setup-times and the possibility of selecting alternative routes among the available machines. The proposed strategy is a variant of the Iterative Flattening Search (IFS) schema. This work provides three separate results: (1) a constraint-based solving procedure that extends...

In the paper we discuss the influence of the route flexibility degree, the open rate of operations and the production type coefficient on makespan. The flexible job-open shop scheduling problem FJOSP (an extension of the classical job shop scheduling) is analyzed. For the analysis of the production process we used a hybrid heuristic of the GRASP (greedy randomized adaptive search procedure) wit...