A modification of Hochbaum and Shmoys' algorithm for scheduling problems

DOI10.1007/BF01952782MaRDI QIDQ751286zbMATH OpenOpenAlexFDO

Authors H. van de Vel, Sun Shijie

Publication date 1991

Published in BIT (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01952782

zbMATH Keywords

bin-packingminimum makespanscheduling

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach
• scientific article; zbMATH DE number 4011924
• scientific article; zbMATH DE number 4170628
• Approximation algorithms for scheduling unrelated parallel machines
• An approximation algorithm for scheduling on three dedicated machines

Cites work

• Bounds for Certain Multiprocessing Anomalies
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)

Cited in

(2)

• Cellular automata approach to scheduling problem in case of modifications of a program graph
• scientific article; zbMATH DE number 2166451 (Why is no real title available?)

This page was built for publication: A modification of Hochbaum and Shmoys' algorithm for scheduling problems

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