Buscar
Mostrando ítems 1-10 de 318
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, ...
DESIGN OF A HYPERHEURISTIC FOR PRODUCTION SCHEDULING IN JOB SHOP ENVIRONMENTS
(Universidad de Tarapacá., 2010)
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 ...
Tardiness minimization in a flexible job shop: A tabu search approach
(Kluwer Academic PublDordrechtHolanda, 2004)
Decomposition methods for large job shops
(PERGAMON-ELSEVIER SCIENCE LTD, 2001)
A rolling horizon heuristic is presented for large job shops, in which the total weighted tardiness must be minimized. The method divides a given instance into a number of subproblems, each having to correspond to a time ...
A Novel Search Algorithm Based On Waterweeds Reproduction Principle For Job Shop Scheduling Problem
(Springer-Verlag London Ltd, 2016)
An corrigendum on the paper: Solving the job-shop scheduling problem optimally by dynamic programming
(Pergamon-Elsevier Science Ltd, 2017-02)
In [1] an algorithm is proposed for solving the job-shop scheduling problem optimally using a dynamic programming strategy. This is, according to our knowledge, the first exact algorithm for the Job Shop problem which is ...
The reversibility property in a job-insertion tiebreaker for the permutational flow shop scheduling problem
(Elsevier B.V.PE, 2021)
The best performing approximate methods proposed for the permutational flow shop scheduling problem with makespan minimization are the well known NEH constructive heuristic and the iterated greedy algorithm. Both methods ...
Tabu search for minimizing total tardiness in a job shop
(Elsevier Science BvAmsterdamHolanda, 2000)