On-line scheduling with non-crossing constraints (Q957355): Difference between revisions

@@ Property / DOI @@
-.1016/j.orl.2008.04.005
@@ Property / DOI: 10.1016/j.orl.2008.04.005 / rank @@
-Normal rank
@@ 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/j.orl.2008.04.005
+Normal rank
@@ Property / OpenAlex ID @@
+W2106461756
@@ Property / OpenAlex ID: W2106461756 / rank @@
+Normal rank
@@ Property / cites work @@
+Crane scheduling with spatial constraints
@@ Property / cites work: Crane scheduling with spatial constraints / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithm Theory - SWAT 2004
@@ Property / cites work: Algorithm Theory - SWAT 2004 / rank @@
+Normal rank
@@ Property / cites work @@
+A <i>m</i>‐parallel crane scheduling problem with a non‐crossing constraint
+Normal rank
@@ Property / cites work @@
+Crane scheduling with non-crossing constraint
@@ Property / cites work: Crane scheduling with non-crossing constraint / rank @@
+Normal rank
@@ Property / cites work @@
+Container terminal operation and operations research -- a classification and literature review
+Normal rank
@@ Property / cites work @@
+Scheduling on identical machines: How good is LPT in an on-line setting?
+Normal rank
@@ Property / DOI @@
+.1016/J.ORL.2008.04.005
@@ Property / DOI: 10.1016/J.ORL.2008.04.005 / rank @@
+Normal rank