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

@@ Property / author @@
+Wiesław X. Kubiak
@@ Property / author: Wiesław X. Kubiak / rank @@
+Normal rank
@@ 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(89)90225-7
+Normal rank
@@ Property / OpenAlex ID @@
+W1997460775
@@ Property / OpenAlex ID: W1997460775 / rank @@
+Normal rank
@@ 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