A min-sum 3/2-approximation algorithm for scheduling unrelated parallel machines (Q1592284): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Minimizing Average Flow Time with Parallel Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling independent tasks to reduce mean finishing time / rank
 
Normal rank
Property / cites work
 
Property / cites work: A PTAS for minimizing the weighted sum of job completion times on parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1002/(sici)1099-1425(199903/04)2:2<73::aid-jos18>3.0.co;2-q / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2015033265 / rank
 
Normal rank

Latest revision as of 09:45, 30 July 2024

scientific article
Language Label Description Also known as
English
A min-sum 3/2-approximation algorithm for scheduling unrelated parallel machines
scientific article

    Statements