Semi-online scheduling on two identical machines with a common due date to maximize total early work (Q827603): Difference between revisions

@@ Property / author @@
-Jacek Błażewicz
@@ Property / author: Jacek Błażewicz / rank @@
-Normal rank
@@ Property / author @@
+Jacek Błażewicz
@@ Property / author: Jacek Błażewicz / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q115198393
@@ Property / Wikidata QID: Q115198393 / rank @@
+Normal rank
@@ 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.dam.2020.05.023
+Normal rank
@@ Property / OpenAlex ID @@
+W3035665153
@@ Property / OpenAlex ID: W3035665153 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimizing the total weighted late work in scheduling of identical parallel processors with communication delays
+Normal rank
@@ Property / cites work @@
+Q3680271
@@ Property / cites work: Q3680271 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimizing mean weighted execution time loss on identical and uniform processors
+Normal rank
@@ Property / cites work @@
+Open shop scheduling problems with late work criteria.
+Normal rank
@@ Property / cites work @@
+The two-machine flow-shop problem with weighted late work criterion and common due date
+Normal rank
@@ Property / cites work @@
+A note on the two machine job shop with the weighted late work criterion
+Normal rank
@@ Property / cites work @@
+Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date
+Normal rank
@@ Property / cites work @@
+Scheduling on parallel identical machines with late work criterion: offline and online cases
+Normal rank
@@ Property / cites work @@
+Single‐machine scheduling with deadlines to minimize the total weighted late work
+Normal rank
@@ Property / cites work @@
+A survey on makespan minimization in semi-online environments
+Normal rank
@@ Property / cites work @@
+Bounds for Certain Multiprocessing Anomalies
@@ Property / cites work: Bounds for Certain Multiprocessing Anomalies / rank @@
+Normal rank
@@ Property / cites work @@
+Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
+Normal rank
@@ Property / cites work @@
+Semi on-line scheduling on two identical machines
@@ Property / cites work: Semi on-line scheduling on two identical machines / rank @@
+Normal rank
@@ Property / cites work @@
+Semi on-line algorithms for the partition problem
@@ Property / cites work: Semi on-line algorithms for the partition problem / rank @@
+Normal rank
@@ Property / cites work @@
+A Fully Polynomial Approximation Scheme for Scheduling a Single Machine to Minimize Total Weighted Late Work
+Normal rank
@@ Property / cites work @@
+Q4821818
@@ Property / cites work: Q4821818 / rank @@
+Normal rank
@@ Property / cites work @@
+Single Machine Scheduling to Minimize Total Late Work
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for scheduling a single machine to minimize total late work
+Normal rank
@@ Property / cites work @@
+THE NP-HARDNESS OF MINIMIZING THE TOTAL LATE WORK ON AN UNBOUNDED BATCH MACHINE
+Normal rank
@@ Property / cites work @@
+Polynomial time approximation scheme for two parallel machines scheduling with a common due date to maximize early work
+Normal rank
@@ Property / cites work @@
+When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?
+Normal rank
@@ Property / cites work @@
+Approximation schemes for single‐machine scheduling with a fixed maintenance activity to minimize the total amount of late work
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:827603