Pages that link to "Item:Q1249132"
From MaRDI portal
The following pages link to Resource constrained scheduling as generalized bin packing (Q1249132):
Displayed 42 items.
- Vector bin packing with multiple-choice (Q427903) (← links)
- On the absolute approximation ratio for first fit and related results (Q442205) (← links)
- Tighter bounds of the First Fit algorithm for the bin-packing problem (Q602685) (← links)
- Approximation algorithms for time constrained scheduling (Q676776) (← links)
- Resource scheduling with variable requirements over time (Q835625) (← links)
- Strip packing with precedence constraints and strip packing with release times (Q837172) (← links)
- The generalized assignment problem: Valid inequalities and facets (Q909579) (← links)
- Online interval coloring with packing constraints (Q954991) (← links)
- On lazy bin covering and packing problems (Q1041247) (← links)
- The poset scheduling problem (Q1062616) (← links)
- Bin packing with divisible item sizes (Q1100914) (← links)
- List scheduling bounds for UET systems with resources (Q1139371) (← links)
- Bin packing can be solved within 1+epsilon in linear time (Q1164429) (← links)
- Assembly line balancing as generalized bin packing (Q1167660) (← links)
- Repacking helps in bounded space on-line bin-packing (Q1207048) (← links)
- Bounds on list scheduling of UET tasks with restricted resource constraints (Q1259426) (← links)
- Properties of some ILP formulations of a class of partitioning problems (Q1270767) (← links)
- A branch-and-bound algorithm for the two-dimensional vector packing problem (Q1317086) (← links)
- Multiple-type, two-dimensional bin packing problems: Applications and algorithms (Q1339128) (← links)
- Tight approximations for resource constrained scheduling and bin packing (Q1372745) (← links)
- Approximate strong separation with application in fractional graph coloring and preemptive scheduling. (Q1401329) (← links)
- Exact and approximation algorithms for geometric and capacitated set cover problems (Q1759660) (← links)
- A linear time algorithm for restricted bin packing and scheduling problems (Q1837623) (← links)
- An approximation algorithm with absolute worst-case performance ratio 2 for two-dimensional vector packing (Q1870001) (← links)
- Algorithms for on-line bin-packing problems with cardinality constraints (Q1887058) (← links)
- Worst-case analysis of the FFH algorithm for online variable-sized bin packing (Q1909600) (← links)
- The tight absolute bound of First Fit in the parameterized case (Q2355708) (← links)
- Parallel machine scheduling with additional resources: notation, classification, models and solution methods (Q2356015) (← links)
- Improved approximation algorithms for maximum resource bin packing and lazy bin covering problems (Q2379919) (← links)
- A two-dimensional vector packing model for the efficient use of coil cassettes (Q2387252) (← links)
- A note on a selfish bin packing problem (Q2393075) (← links)
- A Framework for Distributing Real-Time Functions (Q3543297) (← links)
- On Packing Two-Dimensional Bins (Q3958477) (← links)
- A Tight Asymptotic Bound for Next-Fit-Decreasing Bin-Packing (Q3960135) (← links)
- Scheduling unit-time tasks in renewable resource constrained flowshops (Q4031376) (← links)
- Approximation scheduling algorithms: a survey (Q4207781) (← links)
- Solving multiple processor and multiple resource constrained scheduling problems using a genetic algorithm approach (Q4498115) (← links)
- TOC-based planning and scheduling model (Q4671272) (← links)
- Sequential selection of random vectors under a sum constraint (Q4819442) (← links)
- On-line bin packing ? A restricted survey (Q4845093) (← links)
- Lower bounds and algorithms for the 2-dimensional vector packing problem (Q5939229) (← links)
- On-line scheduling of parallel jobs with runtime restrictions (Q5958714) (← links)