Pages that link to "Item:Q392175"

The following pages link to Tight absolute bound for first fit decreasing bin-packing: \(\operatorname{FFD}(L)\leq 11/9 \operatorname{OPT}(L)+6/9\) (Q392175):

Displayed 24 items.

• Bin packing and cutting stock problems: mathematical models and exact algorithms (Q323473) ‎ (← links)
• Max-min bin packing algorithm and its application in nano-particles filling (Q528368) ‎ (← links)
• Minmizing service span with batch-position-based learning effects (Q828675) ‎ (← links)
• Single machine scheduling with job delivery to multiple customers (Q1617286) ‎ (← links)
• Scheduling with interjob communication on parallel processors (Q1631686) ‎ (← links)
• Bin packing under linear constraints (Q1679514) ‎ (← 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)
• Scheduling with job delivery coordination on single machine (Q1744622) ‎ (← links)
• Cutting stock problems with nondeterministic item lengths: a new approach to server consolidation (Q2001201) ‎ (← links)
• A tight approximation algorithm for problem \(P2\rightarrow D|v=1,c=1|C_{\max }\) (Q2084601) ‎ (← links)
• An introduction to stochastic bin packing-based server consolidation with conflicts (Q2146367) ‎ (← links)
• Non-resumable scheduling on a single bounded parallel-batch machine with periodic maintenance (Q2156319) ‎ (← links)
• A variable neighborhood search approach to solve the order batching problem with heterogeneous pick devices (Q2171595) ‎ (← links)
• Open-end bin packing: new and old analysis approaches (Q2172402) ‎ (← links)
• Two parallel machines scheduling with two-vehicle job delivery to minimize makespan (Q2296256) ‎ (← links)
• Batched bin packing revisited (Q2398649) ‎ (← links)
• Approximation and online algorithms for multidimensional bin packing: a survey (Q2400930) ‎ (← links)
• Compact integer linear programming formulations for the temporal bin packing problem with fire-ups (Q2668727) ‎ (← links)
• Mathematical models and approximate solution approaches for the stochastic bin packing problem (Q2669539) ‎ (← links)
• Scheduling with Interjob Communication on Parallel Processors (Q2958346) ‎ (← links)
• PARALLEL MACHINE SCHEDULING WITH JOB DELIVERY COORDINATION (Q5370785) ‎ (← links)
• Several methods of analysis for cardinality constrained bin packing (Q5918534) ‎ (← links)
• Several methods of analysis for cardinality constrained bin packing (Q5970788) ‎ (← links)