Pages that link to "Item:Q1249132"

The following pages link to Resource constrained scheduling as generalized bin packing (Q1249132):

Displaying 50 items.

• There is no asymptotic PTAS for two-dimensional vector packing (Q293152) (← links)
• Multidimensional dual-feasible functions and fast lower bounds for the vector packing problem (Q297181) (← links)
• A single machine scheduling problem with two-dimensional vector packing constraints (Q319018) (← links)
• Procedures for the bin packing problem with precedence constraints (Q322561) (← links)
• Vector bin packing with heterogeneous bins: application to the machine reassignment problem (Q338869) (← links)
• The load-balanced multi-dimensional bin-packing problem (Q342477) (← links)
• 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)
• The tight asymptotic approximation ratio of first fit for bin packing with cardinality constraints (Q1635504) (← links)
• Bin packing game with a price of anarchy of \(\frac{3}{2}\) (Q1702843) (← links)
• Offline first-fit decreasing height scheduling of power loads (Q1707831) (← 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)
• Selfish vector packing (Q1979465) (← links)
• Packing-based branch-and-bound for discrete malleable task scheduling (Q2093190) (← links)
• Online bin packing with cardinality constraints resolved (Q2186811) (← links)
• On online algorithms for bin, strip, and box packing, and their worst-case and average-case analysis (Q2217210) (← 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)
• Approximation and online algorithms for multidimensional bin packing: a survey (Q2400930) (← links)
• Scheduling selfish jobs on multidimensional parallel machines (Q2404079) (← links)
• Bounds for online bin packing with cardinality constraints (Q2629856) (← links)
• The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers (Q2691324) (← links)
• Online two-dimensional vector packing with advice (Q2692736) (← links)
• Selfish Vector Packing (Q3452809) (← links)