A pseudo-polynomial algorithm for a two-machine no-wait job-shop scheduling problem (Q915632): Difference between revisions

@@ Property / cites work @@
+Q3470246
@@ Property / cites work: Q3470246 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimizing maximum lateness in a two-machine unit-time job shop
+Normal rank
@@ Property / cites work @@
+Q3942735
@@ Property / cites work: Q3942735 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+An Efficient Optimal Algorithm for the Two-Machines Unit-Time Jobshop Schedule-Length Problem
+Normal rank
@@ Property / cites work @@
+Computational Complexity of Discrete Optimization Problems
+Normal rank
@@ Property / cites work @@
+Complexity of Scheduling Shops with No Wait in Process
+Normal rank
@@ Property / cites work @@
+Some no-wait shops scheduling problems: Complexity aspect
+Normal rank