Efficient heuristics to minimize total flow time with release dates (Q1195875): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Scheduling with release dates on a single machine to minimize total weighted completion time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling of a single machine to minimize total weighted completion time subject to release dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: On n/1/?? dynamic deterministic problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4017560 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4658190 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Scheduling with Ready Times to Minimize Mean Flow Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing Jobs with Unequal Ready Times to Minimize Mean Flow Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for single machine sequencing with release dates to minimize total weighted completion time / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey of Scheduling Rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: On general routing problems / rank
 
Normal rank

Latest revision as of 14:58, 16 May 2024

scientific article
Language Label Description Also known as
English
Efficient heuristics to minimize total flow time with release dates
scientific article

    Statements

    Efficient heuristics to minimize total flow time with release dates (English)
    0 references
    0 references
    4 January 1993
    0 references
    0 references
    0 references
    0 references
    0 references
    release dates
    0 references
    worst-case analysis
    0 references
    one machine scheduling
    0 references
    total flow time
    0 references
    strongly NP-hard
    0 references
    local optimality
    0 references
    heuristics
    0 references
    0 references