Improving the preemptive bound for the single machine dynamic maximum lateness problem (Q614050): Difference between revisions

@@ Property / DOI @@
-.1016/j.orl.2010.08.002
@@ Property / DOI: 10.1016/j.orl.2010.08.002 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.orl.2010.08.002
+Normal rank
@@ Property / OpenAlex ID @@
+W2050305112
@@ Property / OpenAlex ID: W2050305112 / rank @@
+Normal rank
@@ Property / cites work @@
+The one-machine sequencing problem
@@ Property / cites work: The one-machine sequencing problem / rank @@
+Normal rank
@@ Property / cites work @@
+Adjustment of heads and tails for the job-shop problem
+Normal rank
@@ Property / cites work @@
+Improving the preemptive bound for the one-machine dynamic total completion time scheduling problem.
+Normal rank
@@ Property / cites work @@
+Some simple scheduling algorithms
@@ Property / cites work: Some simple scheduling algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Q3940839
@@ Property / cites work: Q3940839 / rank @@
+Normal rank
@@ Property / cites work @@
+Branch-and-bound algorithms for solving hard instances of the one-machine sequencing problem
+Normal rank
@@ Property / DOI @@
+.1016/J.ORL.2010.08.002
@@ Property / DOI: 10.1016/J.ORL.2010.08.002 / rank @@
+Normal rank