Matching based very large-scale neighborhoods for parallel machine scheduling (Q415566): 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.1007/s10732-010-9149-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2141035672 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of very large-scale neighborhood search techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Machine Scheduling by Column Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with parallel processors and linear delay costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling identical parallel machines to minimize total weighted completion time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4826104 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two very large-scale neighborhoods for single machine scheduling / 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: An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum matching and a polyhedron with 0,1-vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Creating very large scale neighborhoods out of smaller ones by compounding moves / 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: An exponential neighborhood for a one-machine batching problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst Case Bound of an LRF Schedule for the Mean Weighted Flow-Time Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048571 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4124328 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Scheduling Independent Tasks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A PTAS for Minimizing the Total Weighted Completion Time on Identical Parallel Machines / rank
 
Normal rank

Latest revision as of 03:43, 5 July 2024

scientific article
Language Label Description Also known as
English
Matching based very large-scale neighborhoods for parallel machine scheduling
scientific article

    Statements

    Matching based very large-scale neighborhoods for parallel machine scheduling (English)
    0 references
    0 references
    0 references
    8 May 2012
    0 references
    scheduling
    0 references
    parallel machines
    0 references
    total weighted completion time
    0 references
    very large-scale neighborhoods
    0 references
    local search
    0 references

    Identifiers