A \(\frac 32\)-approximation algorithm for parallel machine scheduling with controllable processing times (Q5949906): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Single machine scheduling with discretely controllable processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3840371 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some comments on sequencing with controllable processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4238767 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3995531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4856179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of results for sequencing problems with controllable processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bicriterion approach to preemptive scheduling of parallel machines with controllable job processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex quadratic and semidefinite programming relaxations in scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Multiple Variable-Speed Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine / rank
 
Normal rank

Latest revision as of 20:35, 3 June 2024

scientific article; zbMATH DE number 1678859
Language Label Description Also known as
English
A \(\frac 32\)-approximation algorithm for parallel machine scheduling with controllable processing times
scientific article; zbMATH DE number 1678859

    Statements

    A \(\frac 32\)-approximation algorithm for parallel machine scheduling with controllable processing times (English)
    0 references
    0 references
    0 references
    0 references
    5 December 2001
    0 references
    scheduling with controllable processing times
    0 references
    quadratic programming
    0 references
    approximation algorithm
    0 references
    total weighted completion time problem
    0 references

    Identifiers