scholarly journals A Petri Net and Beam Search based FMS Scheduling System.

1992 ◽  
Vol 112 (4) ◽  
pp. 377-386 ◽  
Author(s):  
Heloisa Martins Shih ◽  
Takashi Sekiguchi
Keyword(s):  
Petri Net ◽  
Beam Search ◽  
Scheduling System ◽  
Fms Scheduling

Research on Modeling and Simulation of Scheduling with Tool Failure in FMS

2009 ◽  
Vol 419-420 ◽  
pp. 101-104
Author(s):  
Dan Zhao ◽  
Jia Tai Zhang ◽  
Ling Li Li
Keyword(s):  
Modeling And Simulation ◽  
Petri Net ◽  
Dynamic Scheduling ◽  
Simulation Analysis ◽  
Object Oriented ◽  
Actual Case ◽  
Tool Failure ◽  
Scheduling System ◽  
Object Oriented Technology ◽  
Fms Scheduling

Failure in FMS includes two aspects: equipment breakdown and tool failure of which should be considered in an excellent FMS scheduling system. Most of past scheduling researches have only discussed the former and the analysis of the latter rarely seen in relevant papers. The scheduling system without tool failure processing seems to be not coincident to the actually production in which tool breakdowns are very common. This paper gives a dynamic scheduling simulation model with concern of the two kind failure using Object-Oriented technology and Colored Petri Net (OOCPN). Rescheduling strategy of tool failure is proposed and the simulation analysis is given which shows that our model and principle are effective and adaptable to actual case.

Study of Flexible Scheduling System of the Hull Job Shop Based on OOCPN

2009 ◽  
Vol 25 (03) ◽  
pp. 168-173
Author(s):  
Ji Wang ◽  
Yujun Liu ◽  
Zhuoshang Ji ◽  
Yanping Deng ◽  
Yuanyuan Zheng
Keyword(s):  
Petri Net ◽  
Flexible Manufacturing ◽  
Manufacturing System ◽  
Flexible Manufacturing System ◽  
Job Shop ◽  
Object Oriented ◽  
Flexible Scheduling ◽  
Colored Petri Net ◽  
Scheduling System ◽  
Fms Scheduling

The hull job shop in a shipyard is a typical flexible manufacturing system (FMS), the flexibility and efficiency of which largely depends on the level of FMS scheduling. In this paper, the Object-Oriented Colored Petri Net (OOCPN) is used to build the FMS model for the hull job shop. A four-step modeling method of FMS has been developed to successfully simulate the scheduling of the hull job shop.

Extremely Fast Heuristic Event-Driven Job Shop Scheduler With a New Class of Extended Petri Nets

2021 ◽  
pp. 512-539
Author(s):  
Alexander Kostin
Keyword(s):  
Petri Nets ◽  
Petri Net ◽  
Dynamic Models ◽  
Job Shop ◽  
Scheduling System ◽  
New Class ◽  
Extended Petri Nets ◽  
Close Cooperation ◽  
Single Processor ◽  
Unique Mechanism

A very fast scheduling system is proposed and experimentally investigated. The system consists of a job shop manager and dynamic models of machines. A schedule is created in the course of a close cooperation with models of the machines that generate driving events for the scheduler. The system is implemented with a new class of extended Petri nets and runs in the environment of the Petri-net tool WINSIM. The scheduler creates a schedule sequentially, without any form of enumerative search. To investigate the scheduler performance, a large number of experiments were conducted with the use of few strategies. Due to a unique mechanism of monitoring of triggering events in the Petri net, the developed scheduler runs at least hundreds of times faster than any known single-processor job shop scheduler.

Heuristic search based on Petri net structures for FMS scheduling

1999 ◽  
Vol 35 (1) ◽  
pp. 196-202 ◽  
Author(s):  
Mu Der Jeng ◽  
Shih Chang Chen
Keyword(s):  
Petri Net ◽  
Heuristic Search ◽  
Fms Scheduling

Timed Petri Nets and Heuristic Search-Based FMS Scheduling

1996 ◽  
Author(s):  
Ming Dong ◽  
Jianzhong Cha
Keyword(s):  
Petri Nets ◽  
Petri Net ◽  
Heuristic Search ◽  
Scheduling Algorithm ◽  
Optimal Path ◽  
Structural Complexity ◽  
Search Space ◽  
Scheduling Problems ◽  
Timed Petri Nets ◽  
Fms Scheduling

Abstract In this paper, FMS scheduling problems are modeled by timed Petri nets. The timed Petri nets can model the important characteristics of FMSs such as routing flexibility, shared resources, precedence relationships among operations, concurrency, synchronization and lot sizes. So the Petri net model of an FMS scheduling problem which reflects the given constraints would limit the search within the feasible schedule space. By making use of a heuristic scheduling algorithm which satisfies the lower bound condition of the algorithm A*, the search space can be further reduced and an optimal path can be found. This new scheduling approach which combines Petri net modeling with heuristic search can effectively handle with the structural complexity and computational complexity of FMS scheduling problems.

Concurrency and Collision Workflow Modeling and Validating Based on Petri Net in Logistics Vehicle Scheduling System

2012 ◽  
Vol 11 (1) ◽  
pp. 689-692
Author(s):  
Weicheng Xie ◽  
Yongqiang Chen ◽  
Changmin Chen ◽  
Yi Xie
Keyword(s):  
Petri Net ◽  
Vehicle Scheduling ◽  
Workflow Modeling ◽  
Scheduling System
Sign in / Sign up

Export Citation Format

Share Document