Pages that link to "Item:Q3670602"
From MaRDI portal
The following pages link to Shelf Algorithms for Two-Dimensional Packing Problems (Q3670602):
Displayed 46 items.
- Shelf algorithms for on-line strip packing (Q287167) (← links)
- A new lower bound for online strip packing (Q322552) (← links)
- The generalization of scheduling with machine cost (Q392182) (← links)
- Online square packing with gravity (Q476449) (← links)
- Average-case analysis of cutting and packing in two dimensions (Q582210) (← links)
- Online multiple-strip packing (Q621841) (← links)
- Improved online algorithms for parallel job scheduling and strip packing (Q627112) (← links)
- Recent advances on two-dimensional bin packing problems (Q697576) (← links)
- On the effectiveness of the harmonic shelf algorithm for on-line strip packing (Q932692) (← links)
- On-line scheduling of parallel jobs in a list (Q954256) (← links)
- A note on online strip packing (Q1029271) (← links)
- Expected performance of the shelf heuristic for 2-dimensional packing (Q1121176) (← links)
- Multidimensional on-line bin packing: Algorithms and worst-case analysis (Q1123131) (← links)
- Oriented aligned rectangle packing problem (Q1196022) (← links)
- Knowledge based approach to the cutting stock problem (Q1197096) (← links)
- Packing problems (Q1197916) (← links)
- Packings in two dimensions: Asymptotic average-case analysis of algorithms (Q1209735) (← links)
- Multiple-type, two-dimensional bin packing problems: Applications and algorithms (Q1339128) (← links)
- Scheduling space-sharing for internet advertising (Q1600000) (← links)
- iGreen: green scheduling for peak demand minimization (Q1675631) (← links)
- New upper bounds for online strip packing (Q1751205) (← links)
- The two-dimensional cutting stock problem revisited (Q1774168) (← links)
- The nesting problem in the leather manufacturing industry (Q1897382) (← links)
- Efficient heuristics for robot acquisition planning for a CIM system (Q1908995) (← links)
- A new upper bound for the online square packing problem in a strip (Q2012894) (← links)
- Techniques and results on approximation algorithms for packing circles (Q2082050) (← links)
- The variable-width strip packing problem (Q2103938) (← links)
- On online algorithms for bin, strip, and box packing, and their worst-case and average-case analysis (Q2217210) (← links)
- Online scheduling of moldable parallel tasks (Q2317140) (← links)
- Improved lower bound for online strip packing (Q2344211) (← links)
- Approximation and online algorithms for multidimensional bin packing: a survey (Q2400930) (← links)
- Approximate strip packing: revisited (Q2629852) (← links)
- Scheduling non-preemptible jobs to minimize peak demand (Q2633192) (← links)
- Coordination Mechanisms for Selfish Parallel Jobs Scheduling (Q2898033) (← links)
- An Exact Algorithm for Non-preemptive Peak Demand Job Scheduling (Q2942377) (← links)
- WORST-CASE PERFORMANCE EVALUATION ON MULTIPROCESSOR TASK SCHEDULING WITH RESOURCE AUGMENTATION (Q3016228) (← links)
- On some packing problem related to dynamic storage allocation (Q3830539) (← links)
- On-line bin packing ? A restricted survey (Q4845093) (← links)
- (Q5002616) (← links)
- An iterative bidirectional heuristic placement algorithm for solving the two-dimensional knapsack packing problem (Q5058727) (← links)
- AN EFFICIENT JOB SCHEDULING ALGORITHM IN PARTITIONABLE MESH CONNECTED SYSTEMS (Q5249289) (← links)
- On-line algorithms for packing rectangles into several strips (Q5439071) (← links)
- Online Algorithm for Parallel Job Scheduling and Strip Packing (Q5443373) (← links)
- Probabilistic analysis of shelf algorithms for strip packing (Q5491239) (← links)
- Dynamic storage allocation with known durations (Q5918029) (← links)
- Online strip packing with modifiable boxes (Q5949922) (← links)