Scheduling on parallel machines considering job-machine dependency constraints (Q2883591): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.endm.2010.05.055
+Normal rank
@@ Property / OpenAlex ID @@
+W2000264628
@@ Property / OpenAlex ID: W2000264628 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3056948
@@ Property / cites work: Q3056948 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of scheduling problems with multi-purpose machines
+Normal rank
@@ Property / cites work @@
+Complexity results for single-machine problems with positive finish-start time-lags
+Normal rank
@@ Property / cites work @@
+Q4826104
@@ Property / cites work: Q4826104 / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling independent tasks to reduce mean finishing time
+Normal rank
@@ Property / cites work @@
+Scheduling unit time jobs with integer release dates to minimize the weighted number of tardy jobs
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
+Normal rank
@@ Property / cites work @@
+Complexity of scheduling multiprocessor tasks with prespecified processors allocations
+Normal rank
@@ Property / cites work @@
+Technical Note—Minimizing Average Flow Time with Parallel Machines
+Normal rank
@@ Property / cites work @@
+An <i>n</i> Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
+Normal rank