Pages that link to "Item:Q1198607"

The following pages link to 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 (Q1198607):

Displaying 20 items.

• Tight absolute bound for first fit decreasing bin-packing: \(\operatorname{FFD}(L)\leq 11/9 \operatorname{OPT}(L)+6/9\) (Q392175) (← links)
• Single-machine scheduling with periodic maintenance to minimize makespan revisited (Q398924) (← links)
• Tighter bounds of the First Fit algorithm for the bin-packing problem (Q602685) (← links)
• Approximation algorithms for time constrained scheduling (Q676776) (← links)
• Bin packing with rejection revisited (Q848845) (← links)
• Improved algorithms for two single machine scheduling problems (Q860871) (← links)
• On the machine scheduling problem with job delivery coordination (Q884029) (← links)
• A new heuristic algorithm for the machine scheduling problem with job delivery coordination (Q1029329) (← links)
• The FFD algorithm for the bin packing problem with kernel items (Q1272734) (← links)
• The proof of \(\text{FFD}(L)\leq\frac{11}9\text{OPT}(L)+\frac79\) (Q1373809) (← links)
• A tighter bound for FFd algorithm (Q1594856) (← links)
• A simple proof of the inequality \(MFFD(L)\leq {71\over 60}\text{OPT}(L)+1,L\) for the \(MFFD\) bin-packing algorithm (Q1916508) (← links)
• A 3/2-approximation for big two-bar charts packing (Q2045041) (← links)
• Two-bar charts packing problem (Q2047190) (← links)
• Solving robust bin-packing problems with a branch-and-price approach (Q2060393) (← links)
• Two-machine scheduling with periodic availability constraints to minimize makespan (Q2514681) (← links)
• Approximate strip packing: revisited (Q2629852) (← links)
• A Posteriori Analysis of the Algorithms for Two-Bar Charts Packing Problem (Q5054168) (← links)
• A 4/3 OPT+2/3 approximation for big two-bar charts packing problem (Q6147752) (← links)
• An improved approximation for packing big two-bar charts (Q6187994) (← links)