Bounds for the position of the smallest job in completion time variance minimization (Q1296376): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Created claim: Wikidata QID (P12): Q127976795, #quickstatements; #temporary_batch_1722798197196
 
(2 intermediate revisions by 2 users not shown)
Property / cites work
 
Property / cites work: Minimizing Mean Squared Deviation of Completion Times About a Common Due Date / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling about a common due date with earliness and tardiness penalties / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Minimization of Completion Time Variance with a Bicriteria Extension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimising Waiting Time Variance in the Single Machine Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the Flow-time Variance in Single-machine Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing flow time variance in a single machine system using genetic algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of a conjecture of Schrage about the completion time variance problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing Variation of Flow Time in Single Machine Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completion time variance minimization on a single machine is difficult / rank
 
Normal rank
Property / cites work
 
Property / cites work: New results on the completion time variance minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudopolynomial algorithms for CTV minimization in single machine scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variance Minimization in Single Machine Sequencing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid simulated annealing approach for single machine scheduling problems with non-regular penalty functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the Time-in-System Variance for a Finite Jobset / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic and Random Single Machine Sequencing with Variance Minimization / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0377-2217(98)00002-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2087418334 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127976795 / rank
 
Normal rank

Latest revision as of 20:04, 4 August 2024

scientific article
Language Label Description Also known as
English
Bounds for the position of the smallest job in completion time variance minimization
scientific article

    Statements

    Bounds for the position of the smallest job in completion time variance minimization (English)
    0 references
    0 references
    0 references
    2 August 1999
    0 references
    single-machine scheduling
    0 references
    completion time variance
    0 references
    heuristic procedure
    0 references

    Identifiers