Greedy heuristics for single-machine scheduling problems with general earliness and tardiness costs (Q1892102): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Minimizing absolute and squared deviations of completion times with different earliness and tardiness penalties and a common due date / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing mean absolute deviation of completion times about a common due date / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing with Earliness and Tardiness Penalties: A Review / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4287985 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with monotonous earliness and tardiness penalties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the average deviation of job completion times about a common due date / 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: Q3682236 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Best Algorithms for Approximating the Maximum of a Submodular Set Function / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analysis of approximations for maximizing submodular set functions—I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / rank
 
Normal rank

Latest revision as of 14:46, 23 May 2024

scientific article
Language Label Description Also known as
English
Greedy heuristics for single-machine scheduling problems with general earliness and tardiness costs
scientific article

    Statements

    Greedy heuristics for single-machine scheduling problems with general earliness and tardiness costs (English)
    0 references
    0 references
    0 references
    6 July 1995
    0 references
    greedy heuristics
    0 references
    worst-case optimality gaps
    0 references
    single-machine scheduling
    0 references
    common due-date
    0 references
    general earliness and tardiness costs
    0 references

    Identifiers