Untitled

Vieira, Guilherme Ernani; Herrmann, Jeffrey W.; Lin, Edward M.H.

doi:10.1023/a:1022235519958

Cited by 670 publications

(102 citation statements)

References 63 publications

Supporting

Mentioning

102

Contrasting

Order By: Relevance

“…However, current manufacturing scheduling systems have a dynamic nature, they are subject to a variety of unexpected events, which may disturb the working conditions. Therefore, there is a need to incorporate these dynamic events into the scheduling process, in order to ensure feasibility of the scheduling plan that the manufacturing system is following (Cowling et al, 2004;Pinedo, 2005;Priore et al, 2001;Vieira et al, 2003).…”

Section: Dynamic Scheduling Problemmentioning

confidence: 99%

“…The resources can be for example the machines in a workshop, runways at an airport, or processing units in a computer environment, among others. The jobs can be the operations in a workshop, take-offs and landings at an airport, or computer tasks that have to be executed, amongst others (Baker et al, 2009;Ouelhadj et al, 2007;Pinedo, 2005;Priore et al, 2001;Vieira et al, 2003).…”

Section: Definition and Terminology Of Schedulingmentioning

confidence: 99%

“…Also, a dynamic scheduler leads to other important decisions, namely if and when rescheduling should happen. To answer this question, literature have been discussing strategies for rescheduling manufacturing systems, as well as, techniques for solving constraint violations that can occur when unexpected events happen (Baker et al, 2009;He et al, 2008;Pinedo, 2005;Priore et al, 2001;Sabuncuoglu et al, 2009;Vieira et al, 2003;Yingzi et al, 2009). …”

Section: Dynamic Schedulingmentioning

confidence: 99%

“…Rescheduling consists in generating a new schedule to incorporate the changes in the environment and part of the preschedule (the schedule plan prior to occurrence of a dynamic schedule). Ideally this schedule should have an implementation cost as low as possible (Cowling et al, 2004;Vieira et al, 2003). (Vieira et al, 2003) describes two main strategies (reactive scheduling and predictive-reactive scheduling) to control a manufacturing system in a dynamic rescheduling environment that have dynamic jobs arrivals.…”

Section: Dynamic Scheduling Approachesmentioning

confidence: 99%

“…Ideally this schedule should have an implementation cost as low as possible (Cowling et al, 2004;Vieira et al, 2003). (Vieira et al, 2003) describes two main strategies (reactive scheduling and predictive-reactive scheduling) to control a manufacturing system in a dynamic rescheduling environment that have dynamic jobs arrivals. Rescheduling strategies have the goal of answering the question of when scheduling plans should be generated.…”

Section: Dynamic Scheduling Approachesmentioning

confidence: 99%

See 4 more Smart Citations

Selection constructive based hyper-heuristic for dynamic scheduling

Gomes

Madureira

Cunha

2015

2015 10th Iberian Conference on Information Systems and Technologies (CISTI)

View full text Add to dashboard Cite

ii iii ResumoA função de escalonamento desempenha um papel importante nos sistemas de produção. Os sistemas de escalonamento têm como objetivo gerar um plano de escalonamento que permite gerir de uma forma eficiente um conjunto de tarefas que necessitam de ser executadas no mesmo período de tempo pelos mesmos recursos. Contudo, adaptação dinâmica e otimização é uma necessidade crítica em sistemas de escalonamento, uma vez que as organizações de produção têm uma natureza dinâmica. Nestas organizações ocorrem distúrbios nas condições requisitos de trabalho regularmente e de forma inesperada. Alguns exemplos destes distúrbios são: surgimento de uma nova tarefa, cancelamento de uma tarefa, alteração na data de entrega, entre outros. Estes eventos dinâmicos devem ser tidos em conta, uma vez que podem influenciar o plano criado, tornando-o ineficiente. Portanto, ambientes de produção necessitam de resposta imediata para estes eventos, usando um método de reescalonamento em tempo real, para minimizar o efeito destes eventos dinâmicos no sistema de produção. Deste modo, os sistemas de escalonamento devem de uma forma automática e inteligente, ser capazes de adaptar o plano de escalonamento que a organização está a seguir aos eventos inesperados em tempo real.Esta dissertação aborda o problema de incorporar novas tarefas num plano de escalonamento já existente. Deste modo, é proposta uma abordagem de otimização -Hiper-heurística baseada em Seleção Construtiva para Escalonamento Dinâmico-para lidar com eventos dinâmicos que podem ocorrer num ambiente de produção, a fim de manter o plano de escalonamento, o mais robusto possível. Esta abordagem é inspirada em computação evolutiva e hiper-heurísticas. Do estudo computacional realizado foi possível concluir que o uso da hiper-heurística de seleção construtiva pode ser vantajoso na resolução de problemas de otimização de adaptação dinâmica. Palavras AbstractScheduling plays an important role in manufacturing systems. It produces a scheduling plan, in order to share resources to produce several different products in the same time period. However, dynamic adaptation and optimization is a critical need in real-world manufacturing scheduling systems, since contemporary manufacturing organizations have a dynamic nature, where disturbances on working conditions and requirements occur on a continuous basis. Disturbances often arise unexpectedly, and can be for example: urgent job arrival, job cancelation, due date change, delay in the arrival, among others. These dynamic events must be taken into account, since they may have a major impact on the scheduling plan, they can disorder the plan making it ineffective. Therefore, manufacturing environments require immediate response to these dynamic events, using a real-time rescheduling method, in order to minimize the effect of such unexpected events in the performance of the production' system. As result, scheduling systems should have the ability of automatically and intelligently maintain real-time adaptation and optimization to effi...

show abstract

Section: Dynamic Scheduling Problemmentioning

confidence: 99%