Scheduling of conditional executed jobs on unrelated processors

DOI10.1016/0166-218X(94)00013-4MaRDI QIDQ1897352zbMATH OpenOpenAlexFDO

Authors Klaus Jansen

Publication date 30 May 1996

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0166-218x(94)00013-4

zbMATH Keywords

branching forestconditional executed jobsmakespanminimum cost set of processorsunrelated processors

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Scheduling of incompatible jobs on unrelated machines
• Approximation algorithms for multiprocessor scheduling under uncertainty
• Scheduling jobs to minimize total cost
• Cost constrained fixed job scheduling.
• APPROXIMATE AND EXACT ALGORITHMS FOR SCHEDULING INDEPENDENT TASKS ON UNRELATED PROCESSORS

Cites work

• A Greedy Heuristic for the Set-Covering Problem
• A Linear Recognition Algorithm for Cographs
• Approximation algorithms for combinatorial problems
• Approximation algorithms for scheduling unrelated parallel machines
• Efficient probabilistically checkable proofs and applications to approximations
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• NP-complete scheduling problems
• On a property of the class of n-colorable graphs
• On the hardness of approximating minimization problems
• Scheduling of conditional executed jobs on unrelated processors

Cited in

(1)

• Scheduling of conditional executed jobs on unrelated processors

This page was built for publication: Scheduling of conditional executed jobs on unrelated processors

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