scientific article; zbMATH DE number 1405790

MaRDI QIDQ4938775zbMATH OpenFDO

Authors Leah Epstein, Jiří Sgall

Publication date 23 February 2000

zbMATH Keywords

polynomial approximation schemescheduling

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• Approximation schemes for scheduling on parallel machines
• Approximation schemes for scheduling on uniformly related and identical parallel machines
• Improved approximation schemes for scheduling unrelated parallel machines
• Improved Approximation Schemes for Scheduling Unrelated Parallel Machines
• Approximation algorithms for scheduling unrelated parallel machines

Cited in

(21)

• Approximation schemes for scheduling on parallel machines
• Polynomial time approximation schemes for class-constrained packing problems
• Approximation for scheduling on uniform nonsimultaneous parallel machines
• Approximation schemes for scheduling on uniformly related and identical parallel machines
• Simultaneous approximation ratios for parallel machine scheduling problems
• Vector assignment schemes for asymmetric settings
• Optimal preemptive scheduling for general target functions
• Approximations and auctions for scheduling batches on related machines
• Improved approximation schemes for scheduling unrelated parallel machines
• scientific article; zbMATH DE number 4011924 (Why is no real title available?)
• Approximation Algorithms For Scheduling On Uniform Processors
• scientific article; zbMATH DE number 1182760 (Why is no real title available?)
• An efficient polynomial time approximation scheme for load balancing on uniformly related machines
• Performance guarantee of the jump neighborhood for scheduling jobs on uniformly related machines
• Algorithm Theory - SWAT 2004
• Approximating Real-Time Scheduling on Identical Machines
• Improved Approximation Schemes for Scheduling Unrelated Parallel Machines
• Bag-Of-Tasks Scheduling on Related Machines
• Polynomial-time approximation schemes for a class of integrated network design and scheduling problems with parallel identical machines
• Approximation schemes for packing with item fragmentation
• An approximation algorithm for identical parallel machine scheduling with resource dependent processing times

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4938775)