Genetic algorithm for bi-criteria single machine scheduling problem of minimizing maximum earliness and number of tardy jobs (Q990722): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4692508 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing total earliness and tardiness on a single machine using a hybrid heuristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4002567 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the sum of earliness/tardiness in identical parallel machines schedule with incompatible job families: An improved MIP approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using genetic algorithms for single-machine bicriteria scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2743969 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An <i>n</i> Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient genetic algorithm for determining the optimal price discrimination / rank
 
Normal rank

Revision as of 03:07, 3 July 2024

scientific article
Language Label Description Also known as
English
Genetic algorithm for bi-criteria single machine scheduling problem of minimizing maximum earliness and number of tardy jobs
scientific article

    Statements

    Genetic algorithm for bi-criteria single machine scheduling problem of minimizing maximum earliness and number of tardy jobs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    1 September 2010
    0 references
    genetic algorithm
    0 references
    bi-criteria scheduling
    0 references
    number of tardy jobs
    0 references
    maximum earliness
    0 references

    Identifiers