2009
DOI: 10.1007/s00170-009-1981-3
|View full text |Cite
|
Sign up to set email alerts
|

A deadlock-free scheduling with sequence-dependent setup times

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
1
0
1

Year Published

2010
2010
2015
2015

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(4 citation statements)
references
References 13 publications
0
1
0
1
Order By: Relevance
“…They presented the conditions under which infeasible solutions in scheduling problems occur and developed an algorithm to remove such infeasibilities. Zhang et al 67 proposed a new method for solving J/ST sd,j /C max . They modeled the problem with timed Petri nets (TPN) and introduced control arcs on Petri nets to reduce deadlocks.…”
Section: Jssps With Non-batch (Job) Setup Timesmentioning
confidence: 99%
“…They presented the conditions under which infeasible solutions in scheduling problems occur and developed an algorithm to remove such infeasibilities. Zhang et al 67 proposed a new method for solving J/ST sd,j /C max . They modeled the problem with timed Petri nets (TPN) and introduced control arcs on Petri nets to reduce deadlocks.…”
Section: Jssps With Non-batch (Job) Setup Timesmentioning
confidence: 99%
“…The constructed modeling of manufacturing systems based on OPN can be fallen in three distinct stages: static analysis, dynamic analysis and integrated application [4,5,6].…”
Section: Modeling Of Manufacturing System Of Dry Resin Transformersmentioning
confidence: 99%
“…According to constructed OPN model, the model is illustrated in Fig. 2, which is simulated by eM-Plant and event controllers [4][5][6][7][8][9]. Ways to Resolve Conflicts.…”
Section: Product Processes and Shop Layoutmentioning
confidence: 99%