Heuristicas para sistemas APS utilizando janelas de processamento: propostas, implementação e exemplos

AUTOR(ES)
DATA DE PUBLICAÇÃO

2003

RESUMO

This work constitutes the second part of the project developing schedules heuristics using tasks processing time windows. The objective of this work is to consider scheduling heuristics in APS environments using the tasks processing time windows for scheduling problems with important due dates. Three types of heuristics had been proposed: the allocation at the beginning or end of the task time window, heuristics using the aggregated demand of the equipments to detect equipment units bottlenecks, and limited tree search heuristics with programming decisions in the form of modifications of the task time window by the user. The allocation heuristics at the beginning or end of the task time window eliminates the need of priorities. The heuristics to detect equipment units bottlenecks allocates the task far from the bottleneck reducing his importance. A limited tree search heuristic allows, through time window modifications, a solution with additional characteristics as reducing the needs of setup tasks.

ASSUNTO(S)

programação heuristica planejamento da produção

ACESSO AO ARTIGO

Documentos Relacionados