Decomposition of Petri nets and Lagrangian relaxation for solving routing problems for AGVs (Q3055383): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1080/00207540701846244 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2164163287 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloured timed Petri net model for real-time control of automated guided vehicle systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Lagrangian Relaxation Method for Solving Integer Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition in automatic generation of Petri nets for manufacturing system control and scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conflict-free shortest-time bidirectional AGV routeing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Survey of research in the design and control of automated guided vehicle systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deadlock avoidance in an automated guidance vehicle system using a coloured Petri net model / rank
 
Normal rank

Latest revision as of 11:15, 3 July 2024

scientific article
Language Label Description Also known as
English
Decomposition of Petri nets and Lagrangian relaxation for solving routing problems for AGVs
scientific article

    Statements

    Identifiers