The following pages link to (Q4938775):
Displaying 12 items.
- Approximation schemes for packing with item fragmentation (Q927410) (← links)
- An approximation algorithm for identical parallel machine scheduling with resource dependent processing times (Q935202) (← links)
- Polynomial time approximation schemes for class-constrained packing problems (Q1348737) (← links)
- Approximation for scheduling on uniform nonsimultaneous parallel machines (Q1702658) (← links)
- Vector assignment schemes for asymmetric settings (Q2491210) (← links)
- Optimal preemptive scheduling for general target functions (Q2581760) (← links)
- Approximations and auctions for scheduling batches on related machines (Q2643820) (← links)
- Approximation Algorithms For Scheduling On Uniform Processors (Q4202255) (← links)
- Performance guarantee of the jump neighborhood for scheduling jobs on uniformly related machines (Q5074358) (← links)
- Approximating Real-Time Scheduling on Identical Machines (Q5405072) (← links)
- Bag-Of-Tasks Scheduling on Related Machines (Q6070373) (← links)
- Polynomial-time approximation schemes for a class of integrated network design and scheduling problems with parallel identical machines (Q6166913) (← links)
