A computational study of constraint satisfaction for multiple capacitated job shop scheduling (Q1266543): Difference between revisions

@@ 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(95)00354-1
+Normal rank
@@ Property / OpenAlex ID @@
+W2168328014
@@ Property / OpenAlex ID: W2168328014 / rank @@
+Normal rank
@@ Property / cites work @@
+A practical use of Jackson's preemptive schedule for solving the job shop problem
+Normal rank
@@ Property / cites work @@
+Q3938812
@@ Property / cites work: Q3938812 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Flowshop and Jobshop Scheduling
@@ Property / cites work: The Complexity of Flowshop and Jobshop Scheduling / rank @@
+Normal rank
@@ Property / cites work @@
+Consistency in networks of relations
@@ Property / cites work: Consistency in networks of relations / rank @@
+Normal rank
@@ Property / cites work @@
+Networks of constraints: Fundamental properties and applications to picture processing
+Normal rank
@@ Property / cites work @@
+A Fast Taboo Search Algorithm for the Job Shop Problem
+Normal rank
@@ Property / cites work @@
+A computational study of constraint satisfaction for multiple capacitated job shop scheduling
+Normal rank
@@ Property / cites work @@
+Job Shop Scheduling by Local Search
@@ Property / cites work: Job Shop Scheduling by Local Search / rank @@
+Normal rank