Approximating weighted completion time via stronger negative correlation

DOI10.1007/S10951-023-00780-YzbMATH Open1548.90189MaRDI QIDQ6620463

Aravind Srinivasan, Alok Baveja, Xiaoran Qu

Publication date: 16 October 2024

Published in: Journal of Scheduling (Search for Journal in Brave)

zbMATH Keywords

schedulingapproximation algorithmscompletion timedependent rounding

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Minimizing average completion time in the presence of release dates
• An approximation algorithm for the generalized assignment problem
• Pipage rounding: a new method of constructing algorithms with proven performance guarantee
• Computing and software science. State of the art and perspectives
• A PTAS for minimizing the weighted sum of job completion times on parallel machines
• Non-approximability results for scheduling problems with minsum criteria
• Convex quadratic and semidefinite programming relaxations in scheduling
• A unified approach to scheduling on unrelated parallel machines
• A new approximation technique for resource‐allocation problems
• Lift-and-Round to Improve Weighted Completion Time on Unrelated Machines
• Scheduling to Minimize Total Weighted Completion Time via Time-Indexed Linear Programming Relaxations
• Weighted Completion Time Minimization for Unrelated Machines via Iterative Fair Contention Resolution
• On a generalization of iterated and randomized rounding
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations

This page was built for publication: Approximating weighted completion time via stronger negative correlation

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