An Application of the Bin-packing Technique to Job Scheduling on Uniform Processors

DOI10.1038/SJ/JORS/0420210MaRDI QIDQ3971845zbMATH OpenOpenAlexFDO

Authors H. van de Vel, Shijie Sun

Publication date 25 June 1992

Published in The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1038/sj/jors/0420210

zbMATH Keywords

approximate solutionuniform machinesminimum makespanbin-packing techniquenon-polynomial algorithm

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Recommendations

• A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach
• scientific article; zbMATH DE number 4011924
• Approximation Algorithms For Scheduling On Uniform Processors
• Scheduling on uniform nonsimultaneous parallel machines

Cited in

(1)

• On solving multiobjective bin packing problems using evolutionary particle swarm optimization

This page was built for publication: An Application of the Bin-packing Technique to Job Scheduling on Uniform Processors

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