A unified formulation of the machine scheduling problem (Q1245650): Difference between revisions

@@ Property / full work available at URL @@
-https://doi.org/10.1016/0377-2217(78)90120-0
-Normal rank
@@ Property / OpenAlex ID @@
-W1977694650
@@ Property / OpenAlex ID: W1977694650 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0377-2217(78)90120-0
+Normal rank
@@ Property / OpenAlex ID @@
+W1977694650
@@ Property / OpenAlex ID: W1977694650 / rank @@
+Normal rank
@@ Property / cites work @@
+Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm
+Normal rank
@@ Property / cites work @@
+The Schedule-Sequencing Problem
@@ Property / cites work: The Schedule-Sequencing Problem / rank @@
+Normal rank
@@ Property / cites work @@
+A Generalized Machine-Scheduling Algorithm
@@ Property / cites work: A Generalized Machine-Scheduling Algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+On the Significance of Solving Linear Programming Problems with Some Integer Variables
+Normal rank
@@ Property / cites work @@
+A Direct Search Method to Locate Negative Cycles in a Graph
+Normal rank
@@ Property / cites work @@
+Coordinating Aggregate and Detailed Scheduling Decisions in the One-Machine Job Shop: Part I. Theory
+Normal rank
@@ Property / cites work @@
+Integer Programming Algorithms: A Framework and State-of-the-Art Survey
+Normal rank
@@ Property / cites work @@
+A Branch-Bound Solution to the General Scheduling Problem
+Normal rank
@@ Property / cites work @@
+Q4404428
@@ Property / cites work: Q4404428 / rank @@
+Normal rank
@@ Property / cites work @@
+Solving Resource-Constrained Network Problems by Implicit Enumeration—Nonpreemptive Case
+Normal rank