Pages that link to "Item:Q602685"
From MaRDI portal
The following pages link to Tighter bounds of the First Fit algorithm for the bin-packing problem (Q602685):
Displaying 15 items.
- Bin packing with ``largest in bottom'' constraint: tighter bounds and generalizations (Q385496) (← links)
- Single-machine scheduling with periodic maintenance to minimize makespan revisited (Q398924) (← links)
- On the absolute approximation ratio for first fit and related results (Q442205) (← links)
- Integrated scheduling on a batch machine to minimize production, inventory and distribution costs (Q1698887) (← links)
- Integrated optimization of material supplying, manufacturing, and product distribution: models and fast algorithms (Q1735170) (← links)
- Bin packing problem with conflicts and item fragmentation (Q2026980) (← links)
- Batch scheduling of nonidentical job sizes with minsum criteria (Q2051908) (← links)
- A heuristic algorithm for solving triangle packing problem (Q2312258) (← links)
- Online results for black and white bin packing (Q2344213) (← links)
- Black and White Bin Packing Revisited (Q3467833) (← links)
- SINGLE MACHINE SCHEDULING WITH BATCH DELIVERY TO MULTIPLE CUSTOMERS IN A STAR-SHAPED NETWORK (Q4921478) (← links)
- Analysis of a first-fit algorithm for the capacitated unit covering problem (Q4976332) (← links)
- A note on the algorithm LPT-FF for a flowshop scheduling with two batch-processing machines (Q5963694) (← links)
- A large neighborhood search algorithm and lower bounds for the variable-sized bin packing problem with conflicts (Q6167663) (← links)
- Renting servers in the cloud: the case of equal duration jobs (Q6657265) (← links)
