Scheduling with bully selfish jobs

DOI10.1007/S00224-011-9336-5zbMATH Open1253.68078OpenAlexW2173778954MaRDI QIDQ692928FDOQ692928

Authors Tami Tamir

Publication date 6 December 2012

Published in Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00224-011-9336-5

zbMATH Keywords

approximation algorithmsschedulingselfish precedence-constraints

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1617256
• A General Scheme for Designing Monotone Algorithms for Scheduling Problems with Precedence Constraints
• Preemptive Scheduling on Selfish Machines
• On-line scheduling with precedence constraints
• Online Scheduling of Precedence Constrained Tasks

Cites work

• scientific article; zbMATH DE number 3466531 (Why is no real title available?)
• scientific article; zbMATH DE number 3521517 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1445306 (Why is no real title available?)
• Algorithms minimizing mean flow time: Schedule-length properties
• Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems
• Approximation schemes for scheduling on uniformly related and identical parallel machines
• Bounds for Certain Multiprocessing Anomalies
• Bounds on Multiprocessing Timing Anomalies
• Complexity of Scheduling under Precedence Constraints
• Complexity results for single-machine problems with positive finish-start time-lags
• Minimizing Total Tardiness on a Single Machine with Precedence Constraints
• NP-complete scheduling problems
• On the Minimization of the Makespan Subject to Flowtime Optimality
• Optimal Sequencing of a Single Machine Subject to Precedence Constraints
• P-Complete Approximation Problems
• Precedence constrained scheduling to minimize sum of weighted completion times on a single machine
• Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints
• Single machine scheduling subject to precedence delays

This page was built for publication: Scheduling with bully selfish jobs

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