An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem (Q336380): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Nonlinear programming and genetic search application for production scheduling in coal mines / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic approach for solving a scheduling problem in a robotized analytical system / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling a round robin tennis tournament under courts and players availability constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving a chemical batch scheduling problem by local search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling independent tasks to reduce mean finishing time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with Deadlines and Loss Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the minimization of total weighted flow time with identical and uniform parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Parallel Machine Scheduling Problems by Column Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experimental Comparison of Approximation Algorithms for Scheduling Unrelated Parallel Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note: A local-search heuristic for large set-covering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterated greedy local search methods for unrelated parallel machine scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A multi-objective iterated greedy search for flowshop scheduling with makespan and flowtime criteria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimization of maximum lateness on parallel machines with sequence-dependent setup times and job release dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shifting representation search for hybrid flexible flowline problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling parallel machines to minimize total weighted and unweighted tardiness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition and hybrid simulated annealing heuristics for the parallel-machine total tardiness problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unrelated parallel machine scheduling using local search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel machine total tardiness scheduling with a new hybrid metaheuristic approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid meta-heuristics for minimizing the total weighted completion time on uniform parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu search for discrete-continuous scheduling problems with heuristic continuous resource allocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterated greedy for the maximum diversity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Makespan minimization for scheduling unrelated parallel machines: a recovering beam search approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: A study on the use of non-parametric tests for analyzing the evolutionary algorithms' behaviour: a case study on the CEC'2005 special session on real parameter optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximations of the critical region of the fbietkan statistic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4187195 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4875178 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4509286 / rank
 
Normal rank

Latest revision as of 21:38, 12 July 2024

scientific article
Language Label Description Also known as
English
An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem
scientific article

    Statements

    An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem (English)
    0 references
    0 references
    0 references
    0 references
    10 November 2016
    0 references
    iterated greedy
    0 references
    unrelated parallel machines
    0 references
    large-scale optimisation
    0 references
    scheduling
    0 references
    0 references
    0 references
    0 references

    Identifiers