Tardiness
Mostrando 13-15 de 15 artigos, teses e dissertações.
-
13. Algoritmos memeticos aplicados aos problemas de sequenciamento em maquinas
The Single Machine Scheduling Problem (SMS) is one of the most representative in the scheduling area. In this work we initially explore the SMS problem with time constraints (due-dates and setup times). The goal is to minimize the total tardiness, which is characterized by the sum of the delays in the production of all products. The method chosen is based on
Publicado em: 1999
-
14. Estudo de meta-heuristicas populacionais para a programação de maquinas paralelas com tempos de preparação dependentes da sequencia e datas de entrega
The application of population-based meta-heuristics on scheduling problems is studied in this work. The problem which is addressed is the minimization of total tardiness when jobs are scheduled on identical parallel machines with sequence dependent set-up times and distinct due dates. Two implementations of Genetic Algorithms and four implementations of Scat
Publicado em: 1998
-
15. Beam Search and idle time insertion in the single-machine scheduling problem in a JIT environment. / Beam Search e inserção de ociosidade no problema de programação de uma máquina em ambiente do tipo JIT.
This work presents some procedures which can be used in production scheduling problems in JIT environments. These procedures may be used in cases of classical production scheduling where the use of the kanban system is infeasible. The case studied is based on a single machine, with multiple due dates, and distinct earliness and tardiness penalties for each j
Publicado em: 1997