Advanced scheduling methodologies for flexible manufacturing systems using Petri nets and heuristic search

Moro, A.R.; Yu, Hongnian; Kelleher, G.

doi:10.1109/robot.2000.846386

Cited by 17 publications

(6 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…BAS requires two inputs: 1. beam width bw, and 2. cutoff co. The beam width is used to limit the number of markings expanded at each depth of the state space whereas cutoff limits the size of OPEN to a [50] propose to set maxt = maxz.…”

Section: Te Classmentioning

confidence: 99%

See 1 more Smart Citation

TIMSPAT – Reachability graph search-based optimization tool for colored Petri net-based scheduling

Baruwa

Piera

Guasch

2016

Computers & Industrial Engineering

View full text Add to dashboard Cite

The combination of Petri net (PN) modeling with AI-based heuristic search (HS) algorithms (PNHS) has been successfully applied as an integrated approach to deal with scheduling problems that can be transformed into a search problem in the reachability graph. While several efficient HS algorithms have been proposed albeit using timed PN, the practical application of these algorithms requires an appropriate tool to facilitate its development and analysis. However, there is a lack of tool support for the optimization of timed colored PN (TCPN) models based on the PNHS approach for schedule generation. Because of its complex data structure, TCPN-based scheduling has often been limited to simulation-based performance analysis only. Also, it is quite difficult to evaluate the strength and tractability of algorithms for different scheduling scenarios due to the different computing platforms, programming languages and data structures employed. In this light, this paper presents a new tool called TIMSPAT developed to overcome the shortcomings of existing tools. Some features that distinguish this tool are the collection of different HS algorithms, the event-driven exploration of the timed state space including its condensed variant, localized enabling of transitions, the introduction of a static place, and its easy-to-use syntax statements. The tool is easily extensible and can be integrated as a component into existing PN simulators and software environments. A comparative study is performed on a real-world eyeglass production system to demonstrate the usage of the tool for scheduling purposes.

show abstract

Section: Te Classmentioning

confidence: 99%

“…Thanks to the common data structure of AI HS methods, the tool is capable of incorporating several search algorithms in a single executable. So far, nine algorithms have been implemented, ranging from the classical A * [60], hybrid heuristic search [31,49,50,59] to anytime algorithms [6,9,47,74,75].…”

Section: Introductionmentioning

confidence: 99%

TIMSPAT – Reachability graph search-based optimization tool for colored Petri net-based scheduling

Baruwa

Piera

Guasch

2016

Computers & Industrial Engineering

View full text Add to dashboard Cite

show abstract

“…Table 4 shows the comparison results for the scheduling problem of example 2. It compares ACAS-TCPN 3 with four existing heuristic search methods based on PN modeling: L1 [3], dynamic window search (DWS) [14], beam A * search (BAS) [17], and stage search [12]. ACAS-TCPN 3 is experimented with two heuristic functions h(M) = 0 and h(SPT, M) as the shortest processing time (SPT) dispatching rule [17].…”

Section: Performance Evaluation and Benchmarkingmentioning

confidence: 99%

“…Artificial intelligence (AI)-based heuristic search methods have been used to avoid exploring the entire state space by simulating only the best scenarios with heuristic evaluation functions. Some of the existing search methods based on Petri net (PN) modeling are A * [3], limited A * expansion [11], stage search [12], beam search [13], dynamic window search [14], dynamic weighting A * algorithm [15], and hybrid heuristic search methods that combine two or more search algorithms [4,[16][17][18]. Most of these approaches reduce the memory requirements of the state space as well as the computation time at the cost of losing optimality [16].…”

Section: Introductionmentioning

confidence: 99%

Anytime heuristic search for scheduling flexible manufacturing systems: a timed colored Petri net approach

Baruwa

Piera

2014

Int J Adv Manuf Technol

View full text Add to dashboard Cite

Given the fluctuations in demand, diversity in products, production flexibility requirements, and tight customer due dates, obtaining optimal production schedules is considered a complex research problem. This can drastically affect the survival of some manufacturing companies in today's fiercely competitive global market. In a very demanding decision-making environment, scheduling problems are dealt with in a short-term horizon, in which computation time is a critical factor. Producing optimal solutions is practically impossible given the time limitations and the nondeterministic polynomial (NP)-hard nature of scheduling problems. This paper presents an anytime-heuristic search approach based on a simulation-optimization framework that combines evaluation methods (simulation) and search methods (optimization) through the reachability analysis (or state space) of timed colored Petri net models to schedule flexible manufacturing systems (FMS). The anytime search algorithm is capable of finding a first suboptimal solution very quickly and continuously improves the solution quality over time. If given enough computation time, the algorithm eventually converges to an optimal solution. The proposed approach is aimed at obtaining optimal or near-optimal solutions to FMS scheduling problems in relatively short computation times with the objective of minimizing the makespan. Its effectiveness is highlighted with excellent results that outperform previous methods on benchmark examples with flexible material handling systems, machine, and routing configurations. The approach can also serve as a decision support tool to assist production schedulers that require rapid and almost real-time responses to time-critical production scheduling on the shop floor.

show abstract

“…Thus, it is a very adequate and efficient tool for studying Internet based telerobotic systems. Although Petri Nets have been used before for modeling and studying robotic systems but that was limited Lo manufacturing and scheduling related problems [13].…”

mentioning

confidence: 99%

Modeling and control of Internet based cooperative teleoperation

Elhajj

Xi²,

Fung³

et al.

Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164)

View full text Add to dashboard Cite

AbstradRobotic operations carried out via the Internet face several challenges and difficulties. These range from human-computer interfacing Gind human-rooot inter action to overcoming random time delay and task syn chronization. These limitations are intensified when multi-operators at multi-sites are collaboratively tele operating multi-robots to achieve a certain task. In this paper, a new modeling and control method for Internet-based cooperative teleoperation is developed. Combining Petri Net model and event-based planning and control theory, the new method provides an ef ficient way to model the conc'urrence and complexity of the Internet-based cooperati\�e teleoperation. It also provides an efficient analysis tool to study the stability, transparency and synchronization of the system.. Fur thermore, the new modeling (lnd control method en ables us to design an Internet .. based cooperative teler obotic system that is reliable, safe and intelligent. This new method has been experimentally implemented in a three site test bed consisting of robotic laboratories in the USA, Hong Kong and Japan. The experimental results have verified the theor' etical development and further demonstrated the advantages of the new mod eling and control method.

show abstract

Advanced scheduling methodologies for flexible manufacturing systems using Petri nets and heuristic search

Cited by 17 publications

References 8 publications

TIMSPAT – Reachability graph search-based optimization tool for colored Petri net-based scheduling

TIMSPAT – Reachability graph search-based optimization tool for colored Petri net-based scheduling

Anytime heuristic search for scheduling flexible manufacturing systems: a timed colored Petri net approach

Modeling and control of Internet based cooperative teleoperation

Contact Info

Product

Resources

About