A polynomial-time algorithm for a flow-shop batching problem with equal-length operations (Q657253): Difference between revisions

@@ Property / cites work @@
+Q4826104
@@ Property / cites work: Q4826104 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4949162
@@ Property / cites work: Q4949162 / rank @@
+Normal rank
@@ Property / cites work @@
+A note on flow-shop and job-shop batch scheduling with identical processing-time jobs
+Normal rank
@@ Property / cites work @@
+Single machine scheduling with batch-dependent setup times
+Normal rank
@@ Property / cites work @@
+Open-shop batch scheduling with identical jobs
@@ Property / cites work: Open-shop batch scheduling with identical jobs / rank @@
+Normal rank
@@ Property / cites work @@
+Flow-shop batch scheduling with identical processing-time jobs
+Normal rank
@@ Property / cites work @@
+Minimizing flow-time on a single machine with integer batch sizes
+Normal rank
@@ Property / cites work @@
+One-pass batching algorithms for the one-machine problem
+Normal rank
@@ Property / cites work @@
+Batching and scheduling in a multi-machine flow shop
+Normal rank
@@ Property / cites work @@
+Batching in single operation manufacturing systems
+Normal rank
@@ Property / cites work @@
+A polynomial algorithm for a one machine batching problem
+Normal rank