On-line scheduling and control of flexible manufacturing cells using automata theory

Golmakani, Hamid Reza; Mills, James K.; Benhabib, B.

doi:10.1080/09511920500064664

Cited by 10 publications

(5 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [25], [26], and [27], the notion of time-augmented automata, or augmented finite automata (AFA), was proposed to incorporate the temporal behavior into the automata model. An integer global clock T, a variable C for each automaton that is reset to T every time an event changes the state of the system, and a label associated to each event to represent the earliest time this event may occur were introduced.…”

Section: Sct Approachesmentioning

confidence: 99%

“…The search for deadlock states was done off-line, before the application of the A * algorithm and these states were removed from the search tree to reduce the search space. In [25] and [27], the RW supervisor was obtained for the modeled system using automata formalism. In order to search for the best schedule, the RW supervisor was augmented with time to obtain the AFA (Section 2.2.2), and a BF strategy was applied to determine the deadlock-free schedule with the best MS.…”

Section: Deadlock-free Schedulingmentioning

confidence: 99%

See 1 more Smart Citation

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

Section: Sct Approachesmentioning

confidence: 99%

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

show abstract

“…Wu and Zhou 32 used a two-layer structure to schedule semiconductor track systems and avoided deadlock, which was modeled with a colored timed resource-oriented Petri net. Golmakani et al 33 employed Ramadge-Wonham (R-W) theory to construct a deadlock-free search space to be utilized by A* search algorithm to obtain deadlock-free schedules. Based on a job insertion algorithm, Fahmy et al 29 proposed a generic deadlock-free reactive scheduling approach for flexible job shops.…”

Section: Introductionmentioning

confidence: 99%

Deadlock-free scheduling of knowledgeable manufacturing cell with multiple machines and products

Yan

Yang

2014

Proceedings of the Institution of Mechanical Engineers, Part B:

View full text Add to dashboard Cite

Under the stochastic production environment of uncertain job arrival, processing times and product demands, the deadlock-free scheduling is studied for a kind of knowledgeable manufacturing cell with multiple machines and products. First, the expected cost objective function is established based on continuous Markov chain with a discount factor, and a stochastic dynamic programming model is obtained by the virtual self-transfer method. Then, the properties of optimal objective function are analyzed and proved, and a heuristics approximate dynamic programming algorithm is proposed, which can effectively overcome the curse of dimensionality problem in the process of solving the dynamic programming model. With the above settled as premises, the deadlock-free scheduling strategy for knowledgeable manufacturing cell is proposed to control the processing rate and avoid system deadlock simultaneously. Finally, a case study is conducted to demonstrate and validate the effectiveness of the deadlock-free scheduling approach.

show abstract

“…RCPSP-MR problems can be regarded in the scheduling of projects, such as mechanizing various production line, launching SCADA systems, launching smart urban systems, dispatching liquid reservoirs fuel, launching different vehicle tracking systems, developing educational simulators, developing electronic Siebel for shooting training and reverse engineering of critical and important equipment. Also, RCPSP-MR is defined and described in this paper is indicated in flexible manufacturing cells (FMCs) according to the related literature [e.g., [42][43][44][45][46][47][48][49][50][51][52][53][54][55].…”

Section: Introductionmentioning

confidence: 99%

Designing a resource-constrained project scheduling model considering multiple routes for flexible project activities: meta-heuristic algorithms

2019

View full text Add to dashboard Cite

Resource constrained project scheduling problem with multiple routes for flexible project activities (RCPSP-MR) is a generalization of the RCPSP, in which for the implementation of each flexible activity in main structure of the project, several exclusive sub-networks are considered. Each sub-network is regarded as a route for the flexible activity. The routes are considered for each flexible activity that are varied in terms of: 1) Number of activities required to execute; 2) Precedence relationship between activates; 3) Allocation of different renewable and nonrenewable resources to each activity; and 4) Effectiveness on the duration and cost of project completion. In this paper, a new mathematical formulation of RCPSP-MR is firstly presented. Then, two solving approaches based on particle swarm optimization (PSO) and genetic algorithm (GA) are proposed to minimize costs of project completion. To evaluate the effectiveness of these proposed approaches, 50 problems (in very small, small, medium, and large-sized test problems) are designed and then are solved. Finally, comparisons are provided. Computational results show that the proposed GA generates high-quality solutions in a timely fashion. Keywords: Resource constrained project scheduling problem (RCPSP), flexible activities, multiple routes, particle swarm optimization (PSO), genetic algorithm (GA) 0,1, 2,..., 1 JN  1 J Set of total project fixed activities, 1 JJ  2 J Set of total flexible project activities, 21 J J J    Set of routes of each flexible activity 2 J   h  Set of total sub network for flexible activity

show abstract

On-line scheduling and control of flexible manufacturing cells using automata theory

Cited by 10 publications

References 17 publications

A generic deadlock-free reactive scheduling approach

A generic deadlock-free reactive scheduling approach

Deadlock-free scheduling of knowledgeable manufacturing cell with multiple machines and products

Designing a resource-constrained project scheduling model considering multiple routes for flexible project activities: meta-heuristic algorithms

Contact Info

Product

Resources

About