Pages that link to "Item:Q1372745"
From MaRDI portal
The following pages link to Tight approximations for resource constrained scheduling and bin packing (Q1372745):
Displaying 14 items.
- Color-bounded hypergraphs. VI: Structural and functional jumps in complexity (Q383764) (← links)
- Approximation algorithms for time constrained scheduling (Q676776) (← links)
- Approximability results for the resource-constrained project scheduling problem with a single type of resources (Q744638) (← links)
- Improving simulated annealing with variable neighborhood search to solve the resource-constrained scheduling problem (Q954251) (← links)
- Color-bounded hypergraphs, IV: Stable colorings of hypertrees (Q968415) (← links)
- Approximate strong separation with application in fractional graph coloring and preemptive scheduling. (Q1401329) (← links)
- Variable and constraint reduction techniques for the temporal bin packing problem with fire-ups (Q2080827) (← links)
- Production, maintenance and resource scheduling: a review (Q2098022) (← links)
- Scheduling with an orthogonal resource constraint (Q2350899) (← links)
- Parallel machine scheduling with additional resources: notation, classification, models and solution methods (Q2356015) (← links)
- Resource constrained scheduling on multiple machines (Q2390306) (← links)
- Compact integer linear programming formulations for the temporal bin packing problem with fire-ups (Q2668727) (← links)
- Approximation Schemes for Machine Scheduling with Resource (In-)dependent Processing Times (Q4972675) (← links)
- (Q5301705) (← links)
