Scheduling is a scientific domain concerning the allocation of limited tasks over time. The goal of scheduling is to maximize (or minimize) different criteria of a facility as makespan, occupation rate of a machine, total tardiness ... In this area, scientific community usually group the problem with, on one hand the system studied, defining the number of machines (one machine, parallel machine...

Flexible job shop scheduling problem (FJSP) is an extended traditional job shop scheduling problem, which more approximates to real scheduling problems. This paper presents a multi-objective genetic algorithm (GA) based on immune and entropy principle to solve the multi-objective FJSP. In this improved multi-objective GA, the immune and entropy principle is used to keep the diversity of individ...

In the multi-operation scheduling that arises in industrial engineering, each job contains multiple tasks (operations) that require execution in different shops. It is assumed that in each shop there is only one machine to perform the required operations. In this paper, a parallel model of multi-operation scheduling is proposed, in which multiple machines are available in each shop to perform t...

  In this paper flexible job-shop scheduling problem (FJSP) is studied in the case of optimizing different contradictory objectives consisting of: (1) minimizing makespan, (2) minimizing total workload, and (3) minimizing workload of the most loaded machine. As the problem belongs to the class of NP-Hard problems, a new hybrid genetic algorithm is proposed to obtain a large set of Pareto-optima...