A modified shifting bottleneck procedure for job-shop scheduling (Q4696979): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1080/00207549308956766
+Normal rank
@@ Property / OpenAlex ID @@
+W2072610440
@@ Property / OpenAlex ID: W2072610440 / rank @@
+Normal rank
@@ Property / cites work @@
+The Shifting Bottleneck Procedure for Job Shop Scheduling
+Normal rank
@@ Property / cites work @@
+The one-machine sequencing problem
@@ Property / cites work: The one-machine sequencing problem / rank @@
+Normal rank
@@ Property / cites work @@
+An Algorithm for Solving the Job-Shop Problem
@@ Property / cites work: An Algorithm for Solving the Job-Shop Problem / rank @@
+Normal rank
@@ Property / cites work @@
+A modified shifting bottleneck procedure for job-shop scheduling
+Normal rank
@@ Property / cites work @@
+Job-Shop Scheduling by Implicit Enumeration
@@ Property / cites work: Job-Shop Scheduling by Implicit Enumeration / rank @@
+Normal rank
@@ Property / cites work @@
+On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness
+Normal rank
@@ Property / cites work @@
+Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times
+Normal rank