Heuristicas para sistemas APS utilizando janelas de processamento

AUTOR(ES)
DATA DE PUBLICAÇÃO

2003

RESUMO

This work constitutes the first 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. Initially some types of heuristics used in commercial Advanced Planning and Scheduling (APS) systems are presented. Some techniques utilized in the development of the new heuristics are discussed, specifically the planning system PCPIP for generation of the tasks time windows (developed in 2000 for the research team where this work was developed), the techniques of propagation of constraints and the scheduling systems based in constrained based search (CBS). Finally three types of heuristics have been proposed: heuristics allocating 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 modification of the tasks time windows by the user. ii

ASSUNTO(S)

programação heuristica planejamento da produção

ACESSO AO ARTIGO

Documentos Relacionados