Paper Info
Title
Modeling and Analysis of Real-Life Job Shop Scheduling Problems by Petri nets
Abstract
Real-life job shop scheduling problems are complex due to the needs of considering batches, setup times, transportation and parallel processing all together. This paper presents a method to model this kind of job shop scheduling problems by timed colored Petri nets. Two analysis methods including occurrence graph and simulation analysis for best makespan are proposed. Case studies are given to compare different modeling and analysis methods. Suggestions are proposed to select appropriate method for the scheduling problems in practice.
Year
DOI
Venue
2008
10.1109/ANSS-41.2008.15
Annual Simulation Symposium
Keywords
Field
DocType
recent technology,scheduling,occurrence graph,petri nets,wireless lan capability,setup time,real-life job shop,petri net,network-delivered service,wireless mesh network,larger geographical area,real-life job shop scheduling problem,job shop scheduling,batch,parallel advance,graph theory,scheduling problems,job shop,timed colored petri nets,information security,scheduling problem,transportation,parallel processing,information systems,heating
Job shop scheduling,Petri net,Fair-share scheduling,Computer science,Job shop,Flow shop scheduling,Two-level scheduling,Real-time computing,Rate-monotonic scheduling,Dynamic priority scheduling,Distributed computing
Conference
ISSN
ISBN
Citations 
1080-241X
0-7695-3143-1
2
PageRank 
References 
Authors
0.51
2
3
Name
Order
Citations
PageRank
Hehua Zhang110912.65
Ming Gu255474.82
Xiaoyu Song347151.61