Pages that link to "Item:Q4290987"
From MaRDI portal
The following pages link to New worst-case results for the bin-packing problem (Q4290987):
Displaying 50 items.
- An improved two-machine flowshop scheduling with intermediate transportation (Q266074) (← links)
- Approximations for constructing tree-form structures using specific material with fixed length (Q315511) (← links)
- Bin packing and cutting stock problems: mathematical models and exact algorithms (Q323473) (← links)
- Solution approaches for the cutting stock problem with setup cost (Q339571) (← links)
- On the absolute approximation ratio for first fit and related results (Q442205) (← links)
- An improved approximation scheme for variable-sized bin packing (Q504994) (← links)
- Order acceptance and scheduling with consideration of service level (Q513576) (← links)
- Tighter bounds of the First Fit algorithm for the bin-packing problem (Q602685) (← links)
- Two-machine flowshop scheduling with intermediate transportation under job physical space consideration (Q632667) (← links)
- Approximation algorithms for time constrained scheduling (Q676776) (← links)
- Best \(k\)-fit bin packing (Q685862) (← links)
- Scheduling jobs under increasing linear machine maintenance time (Q707693) (← links)
- Min-sum bin packing (Q721936) (← links)
- An APTAS for bin packing with clique-graph conflicts (Q832868) (← links)
- Bin packing with rejection revisited (Q848845) (← links)
- Single-machine scheduling with periodic maintenance to minimize makespan (Q858282) (← links)
- Improved algorithms for two single machine scheduling problems (Q860871) (← links)
- On the machine scheduling problem with job delivery coordination (Q884029) (← links)
- Tight results for next fit and worst fit with resource augmentation (Q974751) (← links)
- Unbounded parallel batch scheduling with job delivery to minimize makespan (Q1003499) (← links)
- Approximation algorithms for a hierarchically structured bin packing problem (Q1029084) (← links)
- A new heuristic algorithm for the machine scheduling problem with job delivery coordination (Q1029329) (← links)
- Modified subset sum heuristics for bin packing (Q1044695) (← links)
- Parallel approximation algorithms for bin packing (Q1123807) (← links)
- The FFD algorithm for the bin packing problem with kernel items (Q1272734) (← links)
- Worst-case analyses, linear programming and the bin-packing problem (Q1290661) (← links)
- BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem (Q1362971) (← links)
- Solving a fuel delivery problem by heuristic and exact approaches. (Q1410332) (← links)
- Worst-case analysis of the subset sum algorithm for bin packing. (Q1417595) (← links)
- Linear time-approximation algorithms for bin packing (Q1591548) (← links)
- Single machine scheduling with job delivery to multiple customers (Q1617286) (← links)
- On residual approximation in solution extension problems (Q1631675) (← links)
- Approximation algorithms for constructing specific subgraphs with minimum number of length-bounded stock pieces (Q1641150) (← links)
- Approximation algorithms for constructing spanning \(K\)-trees using stock pieces of bounded length (Q1686555) (← links)
- Approximation algorithms for scheduling jobs with release times and arbitrary sizes on batch machines with non-identical capacities (Q1694821) (← links)
- Knowledge-guided local search for the vehicle routing problem (Q1722960) (← links)
- The optimal absolute ratio for online bin packing (Q1741486) (← links)
- Scheduling with job delivery coordination on single machine (Q1744622) (← links)
- More on batched bin packing (Q1785762) (← links)
- Machine scheduling with job delivery coordination (Q1876146) (← links)
- A 5/4 linear time bin packing algorithm (Q1975969) (← links)
- Online packing of arbitrary sized items into designated and multipurpose bins (Q2001455) (← links)
- Bin packing problem with conflicts and item fragmentation (Q2026980) (← links)
- Batch scheduling of nonidentical job sizes with minsum criteria (Q2051908) (← links)
- Approximation algorithms for constructing required subgraphs using stock pieces of fixed length (Q2082192) (← links)
- Bin packing with divisible item sizes and rejection penalties (Q2136894) (← links)
- Scheduling jobs with sizes and delivery times on identical parallel batch machines (Q2202014) (← links)
- On bin packing with clustering and bin packing with delays (Q2234744) (← links)
- Approximation algorithms for constructing some required structures in digraphs (Q2255946) (← links)
- The freight consolidation and containerization problem (Q2256168) (← links)
