Pages that link to "Item:Q1916508"
From MaRDI portal
The following pages link to A simple proof of the inequality \(MFFD(L)\leq {71\over 60}\text{OPT}(L)+1,L\) for the \(MFFD\) bin-packing algorithm (Q1916508):
Displayed 6 items.
- An improved two-machine flowshop scheduling with intermediate transportation (Q266074) (← links)
- Single-machine scheduling with periodic maintenance to minimize makespan revisited (Q398924) (← links)
- A 3/2-approximation for big two-bar charts packing (Q2045041) (← links)
- Two-bar charts packing problem (Q2047190) (← links)
- SINGLE MACHINE SCHEDULING WITH JOB DELIVERY TO MINIMIZE MAKESPAN (Q3521606) (← links)
- A Posteriori Analysis of the Algorithms for Two-Bar Charts Packing Problem (Q5054168) (← links)