A beam search approach for the optimization version of the car sequencing problem (Q940889): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Heuristics and exact algorithms for solving the Monden problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling / 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: Algorithms for the car sequencing and the level scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving real car sequencing problems with ant colony optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4418384 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Review and comparison of three methods for the solution of the car sequencing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint satisfaction using constraint logic programming / rank
 
Normal rank

Latest revision as of 16:04, 28 June 2024

scientific article
Language Label Description Also known as
English
A beam search approach for the optimization version of the car sequencing problem
scientific article

    Statements

    A beam search approach for the optimization version of the car sequencing problem (English)
    0 references
    0 references
    0 references
    0 references
    3 September 2008
    0 references
    0 references
    car sequencing problem
    0 references
    beam search
    0 references
    scheduling
    0 references
    0 references