Deterministic multiprocessor scheduling with multiple objectives

DOI10.1016/0305-0548(92)90013-UzbMath0767.90036OpenAlexW2031485694MaRDI QIDQ1195096

Yonah Wilamowsky, Bernard Dickman, Sheldon Epstein

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

makespanassignmentmultiple objectivesjob scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (1)

The GST load balancing algorithm for parallel and distributed systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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

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