Makespan minimization for scheduling unrelated parallel machines: a recovering beam search approach (Q1772848): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejor.2004.04.015 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1967864040 / 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: A Recovering Beam Search algorithm for the one-machine dynamic total completion time scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / 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: Heuristics for scheduling unrelated parallel machines / 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: Approximation algorithms for scheduling unrelated parallel machines / 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: Analysis of a linear programming heuristic for scheduling unrelated parallel machines / 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: Duality-Based Algorithms for Scheduling Unrelated Parallel Machines / rank
 
Normal rank

Revision as of 09:23, 10 June 2024

scientific article
Language Label Description Also known as
English
Makespan minimization for scheduling unrelated parallel machines: a recovering beam search approach
scientific article

    Statements

    Makespan minimization for scheduling unrelated parallel machines: a recovering beam search approach (English)
    0 references
    21 April 2005
    0 references
    Scheduling
    0 references
    Unrelated machines
    0 references
    Beam search
    0 references
    0 references
    0 references

    Identifiers