Scheduling tasks with exponential duration on unrelated parallel machines (Q714038): 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/j.dam.2012.06.010 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2124766050 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3425131 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing Tasks with Exponential Service Times to Minimize the Expected Flow Time or Makespan / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5452284 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decomposition theorem for partially ordered sets / rank
 
Normal rank
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: Q5538300 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hyperbolic 0-1 programming and query optimization in information retrieval / rank
 
Normal rank
Property / cites work
 
Property / cites work: Project scheduling under uncertainty: survey and research potentials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Scheduling under Precedence Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4055377 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4918387 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling of stochastic tasks on two parallel processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: On complexity of unconstrained hyperbolic 0--1 programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5462193 / rank
 
Normal rank
Property / cites work
 
Property / cites work: (0, 1) hyperbolic programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-complete scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Jobs with Exponential Processing and Arrival Times on Identical Processors so as to Minimize the Expected Makespan / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5286651 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling jobs by stochastic processing requirements on parallel machines to minimize makespan or flowtime / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling tasks with exponential service times on non-identical processors to minimize various cost functions / rank
 
Normal rank

Latest revision as of 19:43, 5 July 2024

scientific article
Language Label Description Also known as
English
Scheduling tasks with exponential duration on unrelated parallel machines
scientific article

    Statements

    Scheduling tasks with exponential duration on unrelated parallel machines (English)
    0 references
    0 references
    0 references
    19 October 2012
    0 references
    stochastic parallel scheduling
    0 references
    multiple choice hyperbolic 0-1 programming
    0 references
    directed acyclic graph
    0 references
    NP-hard
    0 references

    Identifiers