A best on-line algorithm for single machine scheduling with small delivery times (Q2481972): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2007.11.006
+Normal rank
@@ Property / OpenAlex ID @@
+W2005453958
@@ Property / OpenAlex ID: W2005453958 / rank @@
+Normal rank
@@ Property / cites work @@
+Jackson's Rule for Single-Machine Scheduling: Making a Good Heuristic Better
+Normal rank
@@ Property / cites work @@
+A Best Possible Deterministic On-Line Algorithm for Minimizing Maximum Delivery Time on a Single Machine
+Normal rank
@@ Property / cites work @@
+PERFORMANCE ANALYSIS OF SIX APPROXIMATION ALGORITHMS FOR THE ONE-MACHINE MAXIMUM LATENESS SCHEDULING PROBLEM WITH READY TIMES
+Normal rank
@@ Property / cites work @@
+Q3995531
@@ Property / cites work: Q3995531 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient approximation schemes for scheduling problems with release dates and delivery times
+Normal rank
@@ Property / cites work @@
+Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times
+Normal rank