SCHEDULING TWO-MACHINE FLOW SHOPS WITH EXACT DELAYS (Q3434279): Difference between revisions

@@ Property / cites work @@
+Minimizing Makespan in No-Wait Job Shops
@@ Property / cites work: Minimizing Makespan in No-Wait Job Shops / rank @@
+Normal rank
@@ Property / cites work @@
+Two-machine flow shop scheduling problems with no-wait jobs
+Normal rank
@@ Property / cites work @@
+Two-machine flow shop scheduling problems with minimal and maximal delays
+Normal rank
@@ Property / cites work @@
+Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey
+Normal rank
@@ Property / cites work @@
+Shop Problems With Two Machines and Time Lags
@@ Property / cites work: Shop Problems With Two Machines and Time Lags / rank @@
+Normal rank
@@ Property / cites work @@
+Permutation flowshop scheduling problems with maximal and minimal time lags
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
+Normal rank
@@ Property / cites work @@
+Two-Machine No-Wait Flow Shop Scheduling with Missing Operations
+Normal rank
@@ Property / cites work @@
+Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
+Normal rank
@@ Property / cites work @@
+A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
+Normal rank
@@ Property / cites work @@
+Two-machine flow shop no-wait scheduling with machine maintenance
+Normal rank
@@ Property / cites work @@
+Sequencing <i>n</i> Jobs on Two Machines with Arbitrary Time Lags
+Normal rank
@@ Property / cites work @@
+On the complexity of coupled-task scheduling
@@ Property / cites work: On the complexity of coupled-task scheduling / rank @@
+Normal rank
@@ Property / cites work @@
+Heuristic algorithms for continuous flow-shop problem
+Normal rank
@@ Property / cites work @@
+Some new results in flow shop scheduling
@@ Property / cites work: Some new results in flow shop scheduling / rank @@
+Normal rank
@@ Property / cites work @@
+The Three-Machine No-Wait Flow Shop is NP-Complete
+Normal rank
@@ Property / cites work @@
+Q5807223
@@ Property / cites work: Q5807223 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of Scheduling Shops with No Wait in Process
+Normal rank
@@ Property / cites work @@
+Makespan Minimization in No-Wait Flow Shops: A Polynomial Time Approximation Scheme
+Normal rank
@@ Property / cites work @@
+Simple algorithms for gilmore-gomory's traveling salesman and related problems
+Normal rank
@@ Property / cites work @@
+Solution of the Flowshop-Scheduling Problem with No Intermediate Queues
+Normal rank
@@ Property / cites work @@
+Inapproximability results for no-wait job shop scheduling.
+Normal rank
@@ Property / cites work @@
+Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard
+Normal rank