Empirically discovering dominance relations for scheduling problems using an evolutionary algorithm (Q3430246): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Tabu search for a class of single-machine scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing mean flowtime in a two-machine flowshop with sequence-independent setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: The two- and \(m\)-machine flowshop scheduling problems with bicriteria of makespan and mean flowtime / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new heuristic for \(m\)-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-machine flowshop minimum-length scheduling problem with random and bounded processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: A flexible flowshop problem with total flow time minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound to minimize the number of late jobs on a single machine with release time constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic optimization system for the determination of index positions on CNC magazines with the consideration of cutting tool duplications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993992 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3970631 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The two-machine total completion time flow shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Job lateness in a two-machine flowshop with setup times separated / 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: A decomposition algorithm for the single machine total tardiness problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trade-off solutions in a single-machine scheduling problem for minimizing total earliness and maximum tardiness / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on defective units in an inventory model with sub-lot sampling inspection for variable lead-time demand with the mixture of free distributions / rank
 
Normal rank

Latest revision as of 15:20, 25 June 2024

scientific article
Language Label Description Also known as
English
Empirically discovering dominance relations for scheduling problems using an evolutionary algorithm
scientific article

    Statements

    Empirically discovering dominance relations for scheduling problems using an evolutionary algorithm (English)
    0 references
    0 references
    0 references
    21 March 2007
    0 references
    scheduling
    0 references
    multimedia
    0 references
    world wide web
    0 references
    flowshop
    0 references
    maximum lateness
    0 references
    dominance relations
    0 references
    0 references
    0 references

    Identifiers