Scheduling with bully selfish jobs

DOI10.1007/s00224-011-9336-5zbMath1253.68078OpenAlexW2173778954MaRDI QIDQ692928

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

schedulingapproximation algorithmsselfish 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)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algorithms minimizing mean flow time: Schedule-length properties
• NP-complete scheduling problems
• Approximation schemes for scheduling on uniformly related and identical parallel machines
• Precedence constrained scheduling to minimize sum of weighted completion times on a single machine
• Complexity results for single-machine problems with positive finish-start time-lags
• Single machine scheduling subject to precedence delays
• Minimizing Total Tardiness on a Single Machine with Precedence Constraints
• P-Complete Approximation Problems
• Complexity of Scheduling under Precedence Constraints
• Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints
• On the Minimization of the Makespan Subject to Flowtime Optimality
• Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems
• Bounds for Certain Multiprocessing Anomalies
• Bounds on Multiprocessing Timing Anomalies
• Optimal Sequencing of a Single Machine Subject to Precedence Constraints

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