The FFD algorithm for the bin packing problem with kernel items (Q1272734): Difference between revisions

@@ Property / author @@
+Guo-Chuan Zhang
@@ Property / author: Guo-Chuan Zhang / 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.1007/s11766-998-0027-1
+Normal rank
@@ Property / OpenAlex ID @@
+W2323908296
@@ Property / OpenAlex ID: W2323908296 / rank @@
+Normal rank
@@ Property / cites work @@
+A new proof for the first-fit decreasing bin-packing algorithm
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4290987
@@ Property / cites work: Q4290987 / rank @@
+Normal rank
@@ Property / cites work @@
+Assembly line balancing as generalized bin packing
+Normal rank
@@ Property / cites work @@
+A simple proof of the inequality \(\text{FFD}(L)\leq {11 \over 9} \text{OPT}(L)+1\), \(\forall L\) for the FFD bin-packing algorithm
+Normal rank
@@ Property / cites work @@
+A new version of on-line variable-sized bin packing
+Normal rank