Deterministic multiprocessor scheduling with multiple objectives

DOI10.1016/0305-0548(92)90013-UMaRDI QIDQ1195096zbMATH OpenOpenAlexFDO

Authors Sheldon Epstein, Yonah Wilamowsky, Bernard Dickman

Publication date 5 October 1992

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0305-0548(92)90013-u

zbMATH Keywords

assignmentjob schedulingmakespanmultiple objectives

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• scientific article; zbMATH DE number 1271325
• Scheduling Multiprocessor Tasks to Minimize Schedule Length
• scientific article; zbMATH DE number 67289
• A Generalized Uniform Processor System

Cites work

• scientific article; zbMATH DE number 3945836 (Why is no real title available?)
• scientific article; zbMATH DE number 3761780 (Why is no real title available?)
• scientific article; zbMATH DE number 3557249 (Why is no real title available?)
• scientific article; zbMATH DE number 3249566 (Why is no real title available?)
• On a scheduling problem where a job can be executed only by a limited number of processors
• Optimization in Multiple-objective Linear Programming Problems with Pre-emptive Priorities

Cited in

(4)

• The GST load balancing algorithm for parallel and distributed systems
• scientific article; zbMATH DE number 3885635 (Why is no real title available?)
• scientific article; zbMATH DE number 1946637 (Why is no real title available?)
• Multi-objective scheduling

This page was built for publication: Deterministic multiprocessor scheduling with multiple objectives

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