Scheduling of conditional executed jobs on unrelated processors

DOI10.1016/0166-218X(94)00013-4zbMATH Open0838.90063OpenAlexW2042700038MaRDI QIDQ1897352FDOQ1897352

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

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

zbMATH Keywords

makespanunrelated processorsbranching forestconditional executed jobsminimum cost set of processors

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Approximation algorithms for combinatorial problems
• A Greedy Heuristic for the Set-Covering Problem
• Approximation algorithms for scheduling unrelated parallel machines
• On the hardness of approximating minimization problems
• A Linear Recognition Algorithm for Cographs
• NP-complete scheduling problems
• Efficient probabilistically checkable proofs and applications to approximations
• On a property of the class of n-colorable graphs
• 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)