On using priced timed automata to achieve optimal scheduling (Q853729): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10703-006-0014-1
+Normal rank
@@ Property / OpenAlex ID @@
+W2162327103
@@ Property / OpenAlex ID: W2162327103 / rank @@
+Normal rank
@@ Property / cites work @@
+Uppaal in a nutshell
@@ Property / cites work: Uppaal in a nutshell / rank @@
+Normal rank
@@ Property / cites work @@
+Q2769586
@@ Property / cites work: Q2769586 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4551180
@@ Property / cites work: Q4551180 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4552456
@@ Property / cites work: Q4552456 / rank @@
+Normal rank
@@ Property / cites work @@
+Benchmarking and comparison of the task graph scheduling algorithms
+Normal rank
@@ Property / cites work @@
+Scheduling Aircraft Landings—The Static Case
@@ Property / cites work: Scheduling Aircraft Landings—The Static Case / rank @@
+Normal rank
@@ Property / cites work @@
+Q3844775
@@ Property / cites work: Q3844775 / rank @@
+Normal rank
@@ Property / cites work @@
+A network simplex method
@@ Property / cites work: A network simplex method / rank @@
+Normal rank
@@ Property / cites work @@
+Q4552463
@@ Property / cites work: Q4552463 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4038702
@@ Property / cites work: Q4038702 / rank @@
+Normal rank