List Scheduling in Order of α-Points on a Single Machine
From MaRDI portal
Publication:5450810
DOI10.1007/11671541_9zbMath1132.90333OpenAlexW2490627488MaRDI QIDQ5450810
No author found.
Publication date: 14 March 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11671541_9
Deterministic scheduling theory in operations research (90B35) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Approximation algorithms (68W25)
Related Items (9)
A constant-factor approximation for directed latency in quasi-polynomial time ⋮ A note on the generalized min-sum set cover problem ⋮ An improved greedy algorithm for stochastic online scheduling on unrelated machines ⋮ Single machine scheduling with job-dependent convex cost and arbitrary precedence constraints ⋮ A Constant-Factor Approximation for Directed Latency in Quasi-Polynomial Time ⋮ Linear programming-based algorithms for the minimum makespan high multiplicity jobshop problem ⋮ Resource cost aware scheduling ⋮ A 2.542-approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective ⋮ LP-based online scheduling: From single to parallel machines
This page was built for publication: List Scheduling in Order of α-Points on a Single Machine
