A note on a single-machine lot scheduling problem with indivisible orders (Q1652143): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.cor.2016.10.004
+Normal rank
@@ Property / OpenAlex ID @@
+W2530743302
@@ Property / OpenAlex ID: W2530743302 / rank @@
+Normal rank
@@ Property / cites work @@
+One-pass batching algorithms for the one-machine problem
+Normal rank
@@ Property / cites work @@
+Optimal Scheduling of Products with Two Subassemblies on a Single Machine
+Normal rank
@@ Property / cites work @@
+Batching to Minimize Flow Times on Parallel Heterogeneous Machines
+Normal rank
@@ Property / cites work @@
+Lot scheduling on a single machine
@@ Property / cites work: Lot scheduling on a single machine / rank @@
+Normal rank
@@ Property / cites work @@
+A polynomial algorithm for a one machine batching problem
+Normal rank
@@ Property / cites work @@
+Minimizing flow-time on a single machine with integer batch sizes
+Normal rank
@@ Property / cites work @@
+Batching in single operation manufacturing systems
+Normal rank
@@ Property / cites work @@
+Batch scheduling of identical jobs on parallel identical machines
+Normal rank
@@ Property / cites work @@
+Scheduling with batching: A review
@@ Property / cites work: Scheduling with batching: A review / rank @@
+Normal rank
@@ Property / cites work @@
+A survey of scheduling problems with setup times or costs
+Normal rank