Algoritmo de programação de máquinas individuais com penalidades distintas de adiantamento e atraso

Abstract

ResumoNeste trabalho consideramos o problema de máquina única, com datas de entrega e penalidades de adiantamento e atraso distintas para cada ordem. Considerando que a seqüência seja predefinida, o objetivo a ser alcançado é a minimização da soma das diferenças (adiantamentos ou atrasos) penalizadas das ordens. Este trabalho é apresentado como uma generalização do algoritmo de programação de Garey et al. (1988). Através de uma estrutura computacional denominada fila de prioridade, este novo algoritmo permite a elaboração de um programa em tempo O(nlogn), enquanto que o melhor encontrado na literatura atualmente é de tempo O(n 2 ).Palavras-chave: programação da produção, inserção de ociosidade, programação JIT. AbstractIn this work we consider the one machine problem, with distinct due-dates and penalties for earliness and tardiness. For a previously defined sequence, we utilize the sum of weighted lateness (earliness or tardiness) as objective function. This work is presented as a generalization of the Garey et al. (1988) scheduling algorithm. Using a computational structure called heap, this algorithm allows a schedule construction in O(nlogn) time while the best found in literature runs in O(n 2 ).

Design of a Hyperheuristic for Production Scheduling in Job Shop Environments

“…However, the different literature reviewed awards us the conclusion that there is not a solution based on an ant colony in which the evaluation function is helped by a genetic algorithm [2,3,6,22,23,54,55]. With results similar to the ones obtained by other artificial intelligence techniques, such as: genetic algorithms, random algorithms and data mining (Tables 12 and 13).…”

“…Currently, the use of hyperheuristics in the processes of production scheduling and programming in Job Shop environments has not been widely spread [4]. However, there are some hyperheuristics based on methodologies such as heuristics [5], algorithms [6][7][8][9][10], genetic algorithms [11][12][13][14], intelligent particles [15][16][17][18][19], ant colonies [20], immune systems [21], and others [22][23][24][25][26][27][28].…”

An algorithm for insertion of idle time in the single-machine scheduling problem with convex cost functions

“…Colin and Shimizu [6] adapted the Garey-Tarjan-Wilfong's algorithm for the asymmetric case maintaining the running time in O(|J | log |J |).…”