An optimal online algorithm for single machine scheduling to minimize total general completion time (Q421265): Difference between revisions

@@ Property / DOI @@
-.1007/s10878-010-9348-0
@@ Property / DOI: 10.1007/s10878-010-9348-0 / rank @@
-Normal rank
@@ Property / full work available at URL @@
-https://doi.org/10.1007/s10878-010-9348-0
-Normal rank
@@ Property / OpenAlex ID @@
-W2050357462
@@ Property / OpenAlex ID: W2050357462 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10878-010-9348-0
+Normal rank
@@ Property / OpenAlex ID @@
+W2050357462
@@ Property / OpenAlex ID: W2050357462 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q57185658
@@ Property / Wikidata QID: Q57185658 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4223058
@@ Property / cites work: Q4223058 / rank @@
+Normal rank
@@ Property / cites work @@
+A class of on-line scheduling algorithms to minimize total completion time
+Normal rank
@@ Property / cites work @@
+Minimizing the total completion time on-line on a single machine, using restarts
+Normal rank
@@ Property / cites work @@
+Q4368485
@@ Property / cites work: Q4368485 / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/S10878-010-9348-0
@@ Property / DOI: 10.1007/S10878-010-9348-0 / rank @@
+Normal rank