Applying new dominance concepts to job schedule optimization (Q1162922): Difference between revisions

@@ Property / author @@
-Jacques Erschler
@@ Property / author: Jacques Erschler / rank @@
-Normal rank
@@ Property / author @@
-C. Mercé
@@ Property / author: C. Mercé / rank @@
-Normal rank
@@ Property / author @@
-François Roubellat
@@ Property / author: François Roubellat / rank @@
-Normal rank
@@ Property / author @@
+Jacques Erschler
@@ Property / author: Jacques Erschler / rank @@
+Normal rank
@@ Property / author @@
+C. Mercé
@@ Property / author: C. Mercé / rank @@
+Normal rank
@@ Property / author @@
+François Roubellat
@@ Property / author: François Roubellat / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Characterizing the set of feasible sequences for n jobs to be carried out on a single machine
+Normal rank
@@ Property / cites work @@
+Minimizing maximum lateness on one machine: computational experience and some applications
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0377-2217(82)80010-6
+Normal rank
@@ Property / OpenAlex ID @@
+W2039607168
@@ Property / OpenAlex ID: W2039607168 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1162922