Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem (Q630678): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Multicriteria scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bi-criteria scheduling problems: Number of tardy jobs and maximum weighted tardiness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2743969 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine scheduling to minimize total weighted earliness subject to minimal number of tardy jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with Multiple Performance Measures: The One-Machine Case / 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: Genetic algorithm for bi-criteria single machine scheduling problem of minimizing maximum earliness and number of tardy jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling to minimize maximum earliness and number of tardy jobs where machine idle time is allowed / 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

Revision as of 21:06, 3 July 2024

scientific article
Language Label Description Also known as
English
Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem
scientific article

    Statements

    Identifiers