A survey of priority rule-based scheduling

Haupt, Reinhard

doi:10.1007/bf01721162

Cited by 421 publications

(134 citation statements)

References 81 publications

Supporting

Mentioning

129

Contrasting

Unclassified

Order By: Relevance

“…by randomly choosing a transition in conflict that should fire. Instead, heuristic dispatching rules [5], such as Shortest Processing Time (SPT), can be introduced when solving the conflicting situations. The schedule of process operations can be determined by observing the marking evolution of the net.…”

Section: Petri Net Based Derivation Of Optimal or Sub-optimal Schedulesmentioning

confidence: 99%

Automated Petri-Net Modelling for Batch Production Scheduling

Gradišar¹,

Mušič²

2012

Petri Nets - Manufacturing and Computer Science

View full text Add to dashboard Cite

Section: Petri Net Based Derivation Of Optimal or Sub-optimal Schedulesmentioning

confidence: 99%

Automated Petri-Net Modelling for Batch Production Scheduling

Gradišar¹,

Mušič²

2012

Petri Nets - Manufacturing and Computer Science

View full text Add to dashboard Cite

“…There is a wide variety of dispatching rules available, especially for dynamic scheduling problems [25,26]. A number of dispatching rules have been associated with the solution of the one-machine total tardiness problem:…”

Section: Solution Representationmentioning

confidence: 99%

Investigating the use of genetic programming for a classic one-machine scheduling problem

Dimopoulos

Zalzala

2001

Advances in Engineering Software

127

View full text Add to dashboard Cite

Genetic programming has rarely been applied to manufacturing optimisation problems. In this paper the potential use of genetic programming for the solution of the one-machine total tardiness problem is investigated. Genetic programming is utilised for the evolution of scheduling policies in the form of dispatching rules. These rules are trained to cope with different levels of tardiness and tightness of due dates. q

show abstract

“…bei Panwalkar / Iskander, 1977;Haupt, 1989. Regel 5, die in der angegebenen Form der oben verwendeten KOZ-Regel entspricht, hat sich in einer stochastisch modifizierten Version (unter Verwendung eines dauer orientierten Regretmaßes) bei der Lösung von (1) - (6) bewährt (vgl. Domschke / Drexl, 1991 b;Drexl / Grünewald, 1991).…”

unclassified

Produktionsplanung und -Steuerung bei Einzel- und Kleinserienfertigung

Drexl

1992

Operations Research Proceedings 1991

View full text Add to dashboard Cite

Standard-Nutzungsbedingungen:Die Dokumente auf EconStor dürfen zu eigenen wissenschaftlichen Zwecken und zum Privatgebrauch gespeichert und kopiert werden.Sie dürfen die Dokumente nicht für öffentliche oder kommerzielle Zwecke vervielfältigen, öffentlich ausstellen, öffentlich zugänglich machen, vertreiben oder anderweitig nutzen.Sofern die Verfasser die Dokumente unter Open-Content-Lizenzen (insbesondere CC-Lizenzen) zur Verfügung gestellt haben sollten, gelten abweichend von diesen Nutzungsbedingungen die in der dort genannten Lizenz gewährten Nutzungsrechte.

show abstract

A survey of priority rule-based scheduling

Cited by 421 publications

References 81 publications

Automated Petri-Net Modelling for Batch Production Scheduling

Automated Petri-Net Modelling for Batch Production Scheduling

Investigating the use of genetic programming for a classic one-machine scheduling problem

Produktionsplanung und -Steuerung bei Einzel- und Kleinserienfertigung

Contact Info

Product

Resources

About