Flow-shop scheduling problem (FSP) deals with the scheduling of a set of n jobs that visit a set of m machines in the same order. As the FSP is NP-hard, there is no efficient algorithm to reach the optimal solution of the problem. To minimize the holding, delay and setup costs of large permutation flow-shop scheduling problems with sequence-dependent setup times on each machine, this pap...

Abstract. This article extracts and analyzes local optima networks for the permutation flow-shop problem. Two widely used move operators for permutation representations, namely, swap and insertion, are incorporated into the network landscape model. The performance of a heuristic search algorithm on this problem is also analyzed. In particular, we study the correlation between local optima netwo...

in this paper, we consider a flow shop scheduling problem with availability constraints (fsspac) for the objective of minimizing the makespan. in such a problem, machines are not continuously available for processing jobs due to preventive maintenance activities. we proposed a mixed-integer linear programming (milp) model for this problem which can generate non-permutation schedules. furthermor...

Iterated local search (ILS) is a general and powerful metaheuristic which provides an easily implementable way of improving the performance of local search algorithms. In this article we consider the application of ILS to the permutation flow shop problem (FSP), a strongly studied problem in machine scheduling. We experimentally investigate the effect of specific implementation choices in our I...

RÉSUMÉ. Bien que les algorithmes évolutionnaires soient couramment utilisés pour résoudre des problèmes multi-objectifs d’une part, et stochastiques d’autre part, très peu de travaux ont été menés sur ces deux aspects simultanément. Par exemple, les problèmes d’ordonnancement sont habituellement traités sous une forme mono-objectif déterministe, alors qu’ils sont clairement multi-objectifs et q...

Focusing on the generation mechanism of random permutation solutions, this paper investigates the application of the Simulated Annealing (SA) algorithm to the combinatorial optimisation problems with permutation property. Six types of perturbation scheme for generating random permutation solutions are introduced. They are proved to satisfy the asymptotical convergence requirements. The results ...