A modified LPT algorithm for the two uniform parallel machine makespan minimization problem (Q2378450): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ejor.2008.02.008
+Normal rank
@@ Property / OpenAlex ID @@
+W2013292956
@@ Property / OpenAlex ID: W2013292956 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal non-preemptive semi-online scheduling on two related machines
+Normal rank
@@ Property / cites work @@
+Bounds for LPT Schedules on Uniform Processors
@@ Property / cites work: Bounds for LPT Schedules on Uniform Processors / rank @@
+Normal rank
@@ Property / cites work @@
+Bounds on Multiprocessing Timing Anomalies
@@ Property / cites work: Bounds on Multiprocessing Timing Anomalies / rank @@
+Normal rank
@@ Property / cites work @@
+A heuristic for maximizing the number of on-time jobs on two uniform parallel machines
+Normal rank
@@ Property / cites work @@
+An improved delayed-start LPT algorithm for a partition problem on two identical parallel machines
+Normal rank
@@ Property / cites work @@
+A Parametric Worst Case Analysis of the LPT Heuristic for Two Uniform Machines
+Normal rank