A look-ahead heuristic for scheduling jobs with release dates on a single machine (Q1342939): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0305-0548(94)90034-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2093926758 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4124328 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / 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: On Scheduling with Ready Times to Minimize Mean Flow Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic Analysis of a Machine Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient heuristics to minimize total flow time with release dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4835595 / rank
 
Normal rank

Latest revision as of 11:29, 23 May 2024

scientific article
Language Label Description Also known as
English
A look-ahead heuristic for scheduling jobs with release dates on a single machine
scientific article

    Statements

    A look-ahead heuristic for scheduling jobs with release dates on a single machine (English)
    0 references
    0 references
    0 references
    15 January 1995
    0 references
    0 references
    on-line heuristics
    0 references
    NP-complete single machine scheduling
    0 references
    independent jobs with release dates
    0 references
    total completion time
    0 references
    0 references