Optimization of inland shipping. A polynomial time algorithm for the single-ship single-lock optimization problem (Q490323): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10951-013-0364-7
+Normal rank
@@ Property / OpenAlex ID @@
+W186322937
@@ Property / OpenAlex ID: W186322937 / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times
+Normal rank
@@ Property / cites work @@
+Scheduling equal-length jobs on identical parallel machines
+Normal rank
@@ Property / cites work @@
+Complexity results for single-machine problems with positive finish-start time-lags
+Normal rank
@@ Property / cites work @@
+A note on scheduling equal-length jobs to maximize throughput
+Normal rank
@@ Property / cites work @@
+Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
+Normal rank
@@ Property / cites work @@
+Scheduling Unit–Time Tasks with Arbitrary Release Times and Deadlines
+Normal rank
@@ Property / cites work @@
+Optimal Sequencing of a Single Machine Subject to Precedence Constraints
+Normal rank
@@ Property / cites work @@
+Recent advances on two-dimensional bin packing problems
+Normal rank
@@ Property / cites work @@
+Q3113703
@@ Property / cites work: Q3113703 / rank @@
+Normal rank
@@ Property / cites work @@
+Multiprocessor Scheduling of Unit-Time Jobs with Arbitrary Release Times and Deadlines
+Normal rank