Buscar
Mostrando ítems 1-10 de 112
Overlap Algorithms in Flexible Job-shop Scheduling
The flexible Job-shop Scheduling Problem (fJSP) considers the execution of jobs by a set of candidate resources while satisfying time and technological constraints. This work, that follows the hierarchical architecture, ...
An enhanced Genetic Algorithm with an innovative encoding strategy for flexible job-shop scheduling with operation and processing flexibility
(Journal of Industrial and Management Optimization, 2020-09-23)
This paper considers the Flexible Job-shop Scheduling Problem with Operation and Processing flexibility (FJSP-OP) with the objective of minimizing the makespan. A Genetic Algorithm based approach is presented to solve the ...
Tardiness minimization in a flexible job shop: A tabu search approach
(Kluwer Academic PublDordrechtHolanda, 2004)
Otimização por colônia de formigas para o problema de programação job-shop flexível multiobjetivo
(Universidade Federal de São CarlosUFSCarPrograma de Pós-Graduação em Ciência da Computação - PPGCCCâmpus São Carlos, 2018-05-10)
The job-shop production scheduling activity is at the most detailed and complex level of a production planning and control system. The Flexible Job-shop Scheduling Problem (FJSP) is an extension of the job-shop scheduling ...
An efficient Pareto approach for solving the multi-objective flexible job-shop scheduling problem with regular criteria
(Computers and Operations Research, 2019)
An effective MILP-based decomposition algorithm for the scheduling and redesign of flexible job-shop plants
(Italian Association of Chemical Engineering, 2019-06)
This paper presents a decomposition algorithm for the integrated scheduling and redesign problem of a multistage batch plant dealing with multipurpose units and heterogeneous recipes. First, the procedure solves the ...
A simple dierential evolution algorithm to solve the flexible job shop scheduling problem
(Universidad Nacional de Rio Cuarto. Facultad de Ciencias Exactas, Físico-Químicas y Naturales. Departamento de Computación, 2019)
This paper addresses the Flexible Job Shop Scheduling Problem (FJSSP) where the objective is to minimize the makespan. We develop a parallel hybrid Differential Evolution (DE) algorithm to tackle this problem. A random key ...