On scheduling multi-processor systems with algebraic objectives

DOI10.1007/BF02251945zbMATH Open0412.68033OpenAlexW391476502MaRDI QIDQ1259901FDOQ1259901

Authors: K. Scholz 

Publication date: 1978

Published in: Computing (Search for Journal in Brave)

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

zbMATH Keywords

job-shop problemminimum cost flow in a transportation networkscheduling multi-processor systems

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of operating systems (68N25)

Cites Work

• NP-complete scheduling problems
• An algebraic approach to assignment problems
• A general Hungarian method for the algebraic transportation problem
• Title not available (Why is that?)

This page was built for publication: On scheduling multi-processor systems with algebraic objectives

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