Modeling and genetic solution of a class of flexible job shop scheduling problems

Tamaki, Hisashi; Ono, Tomoki; Murao, Hajime; Kitamura, Shinzo

doi:10.1109/etfa.2001.997705

Cited by 10 publications

(1 citation statement)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [64], an MIP formulation was proposed to solve the traditional job shop scheduling problem. The models proposed in [61], [65], [66], [67], [68], and [69], did not consider the hold while wait condition, but considered some flexibility related issues like alternative routes, parallel resources of the same type, and re-entrant jobs (or operations). In these models, routing flexibility has been represented using two main approaches.…”

Section: Deadlock-free Schedulingmentioning

confidence: 99%

A generic deadlock-free reactive scheduling approach

Fahmy

Balakrishnan

ElMekkawy

2009

International Journal of Production Research

View full text Add to dashboard Cite

A hierarchical control system is proposed for automated flexible manufacturing cells (FMC) that operate in a job shop flow setting. The control system is made up of a higher level scheduler/reactive scheduler, which optimizes the production flow within the cell, and a lower level supervisor that implements the decisions of the scheduler on the shop floor. Previous studies have regularly considered the production scheduling and the supervisory control as two separate problems. This has led to: i) deadlock-prone optimized schedules that cannot be implemented in an automated setting, ii) deadlockfree optimized schedules that lack the means to be transformed into shop floor supervisors, or iii) supervisors that can safely drive the system with no consideration for production performance. The proposed control system combines mathematical models and an insertion heuristic to solve the deadlock-free scheduling problem in job shops, a deadlock-free reactive scheduling heuristic that can revise the schedules upon the occurrence of a wide variety of disruptions, and a systematic procedure that can transform schedules into readily implementable Petri net (PN) supervisors. The integration of these modules into one control hierarchy guarantees a correct, optimized and agile behavior of the controlled system. The performances of the mathematical models, the scheduling and the reactive scheduling heuristics were evaluated by comparison to performances of previous approaches. Experimental results showed that the proposed modules performed consistently better than the other corresponding approaches. The supervisor realization procedure and the overall control architecture were validated by simulation and

show abstract