Rescheduling job shops under random disruptions

Abumaizar, Riyad J.; Svestka, Joseph A.

doi:10.1080/002075497195074

Cited by 196 publications

(134 citation statements)

References 0 publications

Supporting

Mentioning

127

Contrasting

Unclassified

Order By: Relevance

“…EATÇ Problemlerinde işlerin uygun makineye atanmasının sağlanmasının yanı sıra en iyi iş sırasının belirlenmesi gerektiğinden konu üzerinde yapılan araştırmalar sınırlı kalmıştır. EATÇ problemini ilk olarak Bruker ve Schlie [116] çalışmışlardır [83]. EATÇ Problemleri son zamanlarda araştırmacıların ilgisini çekmeye başlamıştır.…”

Section: Sonuçlar (Conclusion)unclassified

Esnek atölye tipi çizelgeleme problemlerinin meta sezgisel yöntemler ile çözümüne yönelik bir inceleme

Kaya¹,

Fığlalı²

2016

SAUFenBilDer

View full text Add to dashboard Cite

ÖZGerçek yaşam uygulamaları arasında yer alan esnek atölye tipi çizelgeleme (EATÇ) problemleri, klasik atölye tipi çizelgeleme (ATÇ) probleminin genişletilmiş halidir. ATÇ problemlerinde paralel makineler yoktur. Atölyede işlerin paralel makinelerde işlenmesi söz konusu olduğunda EATÇ problemi ortaya çıkar. EATÇ problemlerinde işlerin rotaları birbirinden farklıdır ve her iş en az bir operasyondan oluşmaktadır. Bu operasyonlar, birbirine paralel makine setlerinden herhangi birinde işlem görürler. Literatürde ATÇ problemlerine göre EATÇ problemleri üzerine yapılan çalışmalar oldukça sınırlı kalmıştır. Bu araştırmada, EATÇ problemleri üzerine son yıllarda yapılmış ve literatürde yer alan çalışmalar incelenmiştir. Bu problemlerin meta sezgisel yöntemler ile çözümü üzerine elde edilen bulgular ve öneriler sunulmuştur.Anahtar kelimeler: esnek atölye tipi çizelgeleme, makine atama, operasyon sıralama, hiyerarşik yaklaşım, bütünleşik yaklaşım A review on meta-heuristic approaches to solving flexible job shop scheduling problem ABSTRACT Flexible job shop scheduling (FJSS) problems which are parts of real life applications are the extended case of classical job shop scheduling (JSS) problems. There are no parallel machines at JSS problems. FJSS Problems arise when works need to be done on parallel machines in the workshop. In FJSS problems, jobs have different routes and each job is consisted of at least one operation. These operations are processed by any of the machine sets which are parallel to each other. In literature; the number of studies on FJSS problems are more limited than the one on JSS problems. In this paper, recent studies in the literature on the topic of FJSS problems are reviewed. The findings and recommendations on the solution of this kind of problems by using meta-heuristic methods are presented.

show abstract

Section: Sonuçlar (Conclusion)unclassified

Esnek atölye tipi çizelgeleme problemlerinin meta sezgisel yöntemler ile çözümüne yönelik bir inceleme

Kaya¹,

Fığlalı²

2016

SAUFenBilDer

View full text Add to dashboard Cite

show abstract

“…AOR [8]- [10] es una técnica heurística en la cual sólo la operación que se ve afectada por el efecto de un evento es modificada. El concepto básico de esta técnica es el desplazamiento hacia delante, como en RS, pero sólo de la máquina afectada.…”

Section: Algorithms For Reactive Production Scheduling: An Applicatiounclassified

Algoritmos para la programación reactiva de la producción: Aplicación a la industria cerámica

Gómez-Gasquet¹,

Díaz‐Madroñero²

2014

Bol. Soc. Esp. Ceram. Vidr.

View full text Add to dashboard Cite

“…Building on this idea, Akturk and Gorlulu [4] studied the match-up problem in a modified flow shop environment. Other rescheduling models tried to find a new schedule that has the least deviation costs in the forms of earliness and tardiness penalties charged against the differences in job completion times between the initial and the recovery schedules; see, e.g., Abumaizar and Svestka [1] and Wu, Storer, and Chang [34]. Because of the combinatorial nature of the problems, the most common approaches are problem-specific heuristics and simulations.…”

Section: A Literature Reviewmentioning

confidence: 99%

Disruption management in production planning

Yang

2005

Naval Research Logistics

View full text Add to dashboard Cite

Abstract:We study the problem of recovering a production plan after a disruption, where the disruption may be caused by incidents such as power failure, market change, machine breakdown, supply shortage, worker no-show, and others. The new recovery plan we seek after has to not only suit the changed environment brought about by the disruption, but also be close to the initial plan so as not to cause too much customer unsatisfaction or inconvenience for current-stage and downstream operations. For the general-cost case, we propose a dynamic programming method for the problem. For the convex-cost case, a general problem which involves both cost and demand disruptions can be solved by considering the cost disruption first and then the demand disruption. We find that a pure demand disruption is easy to handle; and for a pure cost disruption, we propose a greedy method which is provably efficient. Our computational studies also reveal insights that will be helpful to managing disruptions in production planning.

show abstract

Rescheduling job shops under random disruptions

Cited by 196 publications

References 0 publications

Esnek atölye tipi çizelgeleme problemlerinin meta sezgisel yöntemler ile çözümüne yönelik bir inceleme

Esnek atölye tipi çizelgeleme problemlerinin meta sezgisel yöntemler ile çözümüne yönelik bir inceleme

Algoritmos para la programación reactiva de la producción: Aplicación a la industria cerámica

Disruption management in production planning

Contact Info

Product

Resources

About