An effective mathematical formulation for the unidirectional cluster-based quay crane scheduling problem (Q2255903): Difference between revisions

@@ Property / cites work @@
+A fast heuristic for quay crane scheduling with interference constraints
+Normal rank
@@ Property / cites work @@
+A crane scheduling method for port container terminals
+Normal rank
@@ Property / cites work @@
+Modeling and solving rich quay crane scheduling problems
+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 @@
+Quay crane scheduling at container terminals to minimize the maximum relative tardiness of vessel departures
+Normal rank
@@ Property / cites work @@
+The quay crane scheduling problem with time windows
+Normal rank
@@ Property / cites work @@
+A branch-and-cut algorithm for the quay crane scheduling problem in a container terminal
+Normal rank
@@ Property / cites work @@
+A tabu search heuristic for the quay crane scheduling problem
+Normal rank
@@ Property / cites work @@
+Crane scheduling with non-crossing constraint
@@ Property / cites work: Crane scheduling with non-crossing constraint / rank @@
+Normal rank