A projective algorithm for preemptive open shop scheduling with two multiprocessor groups (Q969520): Difference between revisions

@@ Property / DOI @@
-.1016/j.orl.2009.10.007
@@ Property / DOI: 10.1016/j.orl.2009.10.007 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.orl.2009.10.007
+Normal rank
@@ Property / OpenAlex ID @@
+W2057623859
@@ Property / OpenAlex ID: W2057623859 / rank @@
+Normal rank
@@ Property / cites work @@
+A generalized class-teacher model for some timetabling problems
+Normal rank
@@ Property / cites work @@
+Complexity of some special types of timetabling problems
+Normal rank
@@ Property / cites work @@
+Preemptive open shop scheduling with multiprocessors: Polynomial cases and applications
+Normal rank
@@ Property / cites work @@
+Scheduling multiprocessor tasks -- An overview
@@ Property / cites work: Scheduling multiprocessor tasks -- An overview / rank @@
+Normal rank
@@ Property / cites work @@
+Open Shop Scheduling to Minimize Finish Time
@@ Property / cites work: Open Shop Scheduling to Minimize Finish Time / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling open shops with parallel machines
@@ Property / cites work: Scheduling open shops with parallel machines / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.ORL.2009.10.007
@@ Property / DOI: 10.1016/J.ORL.2009.10.007 / rank @@
+Normal rank