A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times (Q439552): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q58826366, #quickstatements; #temporary_batch_1711407341029
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Improving the feasibility pump / rank
 
Normal rank
Property / cites work
 
Property / cites work: bc — prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A feasibility pump heuristic for general mixed-integer problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hyper-Heuristics: An Emerging Direction in Modern Search Technology / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic capacitated lot-sizing problems: a classification and review of solution approaches / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cross entropy-lagrangean hybrid algorithm for the multi-item capacitated lot-sizing problem with setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling technicians and tasks in a telecommunications company / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploring relaxation induced neighborhoods to improve MIP solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Dantzig-Wolfe Reformulation and Branch-and-Price Algorithm for the Capacitated Lot-Sizing Problem with Setup Times / rank
 
Normal rank
Property / cites work
 
Property / cites work: On alternative mixed integer programming formulations and LP-based heuristics for lot-sizing with setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: The feasibility pump / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local branching / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tabu-Search Heuristic for the Capacitated Lot-Sizing Problem with Set-up Carryover / rank
 
Normal rank
Property / cites work
 
Property / cites work: An effective heuristic for the CLSP with set-up times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multilevel capacitated lotsizing complexity and LP-based heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general heuristic for vehicle routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Production Planning by Mixed Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix-and-optimize heuristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangean relaxation based heuristics for lot sizing with setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Multi-Item Lot-Sizing Problems with an MIP Solver Using Classification and Reformulation / rank
 
Normal rank

Latest revision as of 13:16, 5 July 2024

scientific article
Language Label Description Also known as
English
A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times
scientific article

    Statements

    A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times (English)
    0 references
    0 references
    0 references
    0 references
    16 August 2012
    0 references
    production
    0 references
    manufacturing
    0 references
    heuristics
    0 references
    large scale optimization
    0 references
    \texttt{ILOG CPLEX}
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references