The complexity of mean flow time scheduling problems with release times (Q880590): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Peter Brucker / rank
Normal rank
 
Property / author
 
Property / author: Marek Chrobak / rank
Normal rank
 
Property / author
 
Property / author: Peter Brucker / rank
 
Normal rank
Property / author
 
Property / author: Marek Chrobak / rank
 
Normal rank
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.1007/s10951-006-0006-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1964568645 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties of optimal schedules in preemptive shop scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Open shop problems with unit time operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing mean flow time with release time constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive Scheduling of Equal Length Jobs on Two Machines to Minimize Mean Flow Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of minimizing the number of late jobs in unit time open shop / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive scheduling to minimize mean weighted flow time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the total completion time in a unit-time open shop with release times / rank
 
Normal rank

Latest revision as of 18:09, 25 June 2024

scientific article
Language Label Description Also known as
English
The complexity of mean flow time scheduling problems with release times
scientific article

    Statements

    The complexity of mean flow time scheduling problems with release times (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    15 May 2007
    0 references
    Scheduling theory
    0 references
    Preemption
    0 references
    Linear programming
    0 references

    Identifiers