Petri net based scheduling

W.M.P. Aalst, van der

doi:10.1007/BF01540160

Petri net based scheduling

W.M.P. Aalst, van der

Research output: Contribution to journal › Article › Academic › peer-review

52 Citations (Scopus)

Abstract

Timed Petri nets can be used to model and analyse scheduling problems. To support the modelling of scheduling problems, we provide a method to map tasks, resources and constraints onto a timed Petri net. By mapping scheduling problems onto Petri nets, we are able to use standard Petri net theory. In this paper we will show that we can use Petri net based tools and techniques to find conflicting and redundant precedences, upper- and lower-bounds for the makespan, etc. This is illustrated by a Petri net based analysis of the notorious 10×10 problem due to Fisher & Thompson (1963)

Original language	English
Pages (from-to)	219-229
Journal	OR Spektrum
Volume	18
Issue number	4
DOIs	https://doi.org/10.1007/BF01540160
Publication status	Published - 1996

Access to Document

10.1007/BF01540160

Cite this

@article{9f5ac63c22644d6284741cb182fbe310,

title = "Petri net based scheduling",

abstract = "Timed Petri nets can be used to model and analyse scheduling problems. To support the modelling of scheduling problems, we provide a method to map tasks, resources and constraints onto a timed Petri net. By mapping scheduling problems onto Petri nets, we are able to use standard Petri net theory. In this paper we will show that we can use Petri net based tools and techniques to find conflicting and redundant precedences, upper- and lower-bounds for the makespan, etc. This is illustrated by a Petri net based analysis of the notorious 10×10 problem due to Fisher & Thompson (1963)",

author = "{Aalst, van der}, W.M.P.",

year = "1996",

doi = "10.1007/BF01540160",

language = "English",

volume = "18",

pages = "219--229",

journal = "OR Spektrum",

issn = "0171-6468",

publisher = "Springer",

number = "4",

}

TY - JOUR

T1 - Petri net based scheduling

AU - Aalst, van der, W.M.P.

PY - 1996

Y1 - 1996

N2 - Timed Petri nets can be used to model and analyse scheduling problems. To support the modelling of scheduling problems, we provide a method to map tasks, resources and constraints onto a timed Petri net. By mapping scheduling problems onto Petri nets, we are able to use standard Petri net theory. In this paper we will show that we can use Petri net based tools and techniques to find conflicting and redundant precedences, upper- and lower-bounds for the makespan, etc. This is illustrated by a Petri net based analysis of the notorious 10×10 problem due to Fisher & Thompson (1963)

AB - Timed Petri nets can be used to model and analyse scheduling problems. To support the modelling of scheduling problems, we provide a method to map tasks, resources and constraints onto a timed Petri net. By mapping scheduling problems onto Petri nets, we are able to use standard Petri net theory. In this paper we will show that we can use Petri net based tools and techniques to find conflicting and redundant precedences, upper- and lower-bounds for the makespan, etc. This is illustrated by a Petri net based analysis of the notorious 10×10 problem due to Fisher & Thompson (1963)

U2 - 10.1007/BF01540160

DO - 10.1007/BF01540160

M3 - Article

SN - 0171-6468

VL - 18

SP - 219

EP - 229

JO - OR Spektrum

JF - OR Spektrum

IS - 4

ER -

Petri net based scheduling

Abstract

Access to Document

Fingerprint

Cite this