The complexity of a cyclic scheduling problem with identical machines and precedence constraints (Q1278237): 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/0377-2217(95)00110-7
+Normal rank
@@ Property / OpenAlex ID @@
+W2077238477
@@ Property / OpenAlex ID: W2077238477 / rank @@
+Normal rank
@@ Property / cites work @@
+Un domaine très ouvert : les problèmes d'ordonnancement
+Normal rank
@@ Property / cites work @@
+Optimal scheduling for two-processor systems
@@ Property / cites work: Optimal scheduling for two-processor systems / rank @@
+Normal rank
@@ Property / cites work @@
+Study of a NP-hard cyclic scheduling problem: The recurrent job-shop
+Normal rank
@@ Property / cites work @@
+A study of the cyclic scheduling problem on parallel processors
+Normal rank
@@ Property / cites work @@
+An approximation algorithm for scheduling dependent tasks on \(m\) processors with small communication delays
+Normal rank
@@ Property / cites work @@
+The complexity of scheduling jobs in repetitive manufacturing systems
+Normal rank
@@ Property / cites work @@
+Sequencing in an Assembly Line with Blocking to Minimize Cycle Time
+Normal rank
@@ Property / cites work @@
+Q3358512
@@ Property / cites work: Q3358512 / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling Sequential Loops on Parallel Processors
+Normal rank
@@ Property / cites work @@
+Cyclic Schedules for Job Shops with Identical Jobs
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1278237