A nonidentical parallel processor scheduling problem

DOI10.1002/1520-6750(198806)35:3%3C419::AID-NAV3220350310%3E3.0.CO;2-5MaRDI QIDQ3783824zbMATH OpenOpenAlexFDO

Authors Nicholas G. Hall, K. Anthony Rhee, Wansoo T. Rhee

Publication date 1988

Full work available at URL https://doi.org/10.1002/1520-6750(198806)35:3%3C419::aid-nav3220350310%3E3.0.co;2-5

zbMATH Keywords

first fit decreasing bin-packing approximationheuristicmakespanparallel processorsschedule length

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Production scheduling of independent jobs on parallel identical processors
• Evaluating scheduling heuristics for non-identical parallel processors
• Optimal Scheduling of Tasks on Identical Parallel Processors
• scientific article; zbMATH DE number 1234084
• scientific article; zbMATH DE number 3941253

Cites work

• Bin packing problems in one dimension: Heuristic solutions and confidence intervals
• scientific article; zbMATH DE number 3778732 (Why is no real title available?)

Cited in

(8)

• Scheduling parallel processors to minimize setup time
• Search techniques for a nonlinear multiprocessor scheduling problem
• Production scheduling of independent jobs on parallel identical processors
• Scheduling multi-stage parallel-processor services to minimize average response time
• Evaluating scheduling heuristics for non-identical parallel processors
• An experimental investigation of scheduling non-identical, parallel processors with sequence-dependent set-up times and due dates
• scientific article; zbMATH DE number 1786151 (Why is no real title available?)
• Stochastic scheduling on two non-identical parallel processors

This page was built for publication: A nonidentical parallel processor scheduling problem

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