Sequencing heuristic for bicriteria scheduling in a single machine problem (Q3411893): 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 / OpenAlex ID
 
Property / OpenAlex ID: W1968505916 / 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: Minimising Waiting Time Variance in the Single Machine 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: Bounds for the position of the smallest job in completion time variance minimization / 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: Minimizing Mean Squared Deviation of Completion Times About a Common Due Date / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-machine scheduling with periodic maintenance and nonresumable jobs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing with setup time and order tardiness trade-offs / rank
 
Normal rank

Latest revision as of 10:48, 25 June 2024

scientific article
Language Label Description Also known as
English
Sequencing heuristic for bicriteria scheduling in a single machine problem
scientific article

    Statements

    Sequencing heuristic for bicriteria scheduling in a single machine problem (English)
    0 references
    0 references
    0 references
    0 references
    30 November 2006
    0 references
    0 references
    scheduling
    0 references
    maximum tardiness
    0 references
    completion times
    0 references
    efficient schedule
    0 references
    0 references