Iterated greedy local search methods for unrelated parallel machine scheduling (Q992577): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejor.2010.03.030 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1981549570 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A state-of-the-art review of parallel-machine scheduling research / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Scheduling Tasks on Unrelated Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recovering beam search: Enhancing the beam search approach for combinatorial optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On practical resource allocation for production planning and scheduling with period overlapping setups / rank
 
Normal rank
Property / cites work
 
Property / cites work: A faster combinatorial approximation algorithm for scheduling unrelated parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / 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: Unrelated parallel machine scheduling using local search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on Multiprocessing Timing Anomalies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search: Principles and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for scheduling unrelated parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact and Approximate Algorithms for Scheduling Nonidentical Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4055377 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for scheduling unrelated parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic algorithms for the portfolio selection problem with minimum transaction lots / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact and approximation algorithms for makespan minimization on unrelated parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with Deadlines and Loss Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4546261 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cutting plane algorithm for the unrelated parallel machine scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics based on partial enumeration for the unrelated parallel processor scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A local search heuristic for unrelated parallel machine scheduling with efficient neighborhood search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planning and Scheduling in Manufacturing and Services / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of a linear programming heuristic for scheduling unrelated parallel machines / 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: An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal rounding gives a better approximation for scheduling unrelated machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation algorithm for the generalized assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling tasks on unrelated machines: large neighborhood improvement procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: An effective heuristic for minimising makespan on unrelated parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5433151 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Duality-Based Algorithms for Scheduling Unrelated Parallel Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Unrelated Parallel Machines Computational Results / rank
 
Normal rank

Latest revision as of 04:46, 3 July 2024

scientific article
Language Label Description Also known as
English
Iterated greedy local search methods for unrelated parallel machine scheduling
scientific article

    Statements

    Iterated greedy local search methods for unrelated parallel machine scheduling (English)
    0 references
    0 references
    0 references
    9 September 2010
    0 references
    0 references
    unrelated parallel machines
    0 references
    makespan
    0 references
    iterated greedy
    0 references
    local search
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references