A polynomial-time algorithm for the two-machine unit-time release-date job-shop schedule-length problem (Q1364482): Difference between revisions

@@ 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 @@
+Q4131987
@@ Property / cites work: Q4131987 / 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 @@
+An efficient algorithm for a job shop problem
@@ Property / cites work: An efficient algorithm for a job shop problem / rank @@
+Normal rank
@@ Property / cites work @@
+Total completion time minimization in two-machine job shops with unit-time operations
+Normal rank
@@ Property / cites work @@
+Computational Complexity of Discrete Optimization Problems
+Normal rank
@@ Property / cites work @@
+On general routing problems
@@ Property / cites work: On general routing problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q3737196
@@ Property / cites work: Q3737196 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3713852
@@ Property / cites work: Q3713852 / rank @@
+Normal rank