Combining the principles of variable neighborhood decomposition search and the Fix\&Optimize heuristic to solve multi-level lot-sizing and scheduling problems (Q339582): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Neighbourhood search meta-heuristics for capacitated lot-sizing with sequence-dependent setups / 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: Lot sizing and scheduling -- survey and extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The double traveling salesman problem with multiple stacks: A variable neighborhood search approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: The discrete lot-sizing and scheduling problem with sequence-dependent setup costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The general lotsizing and scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search: Principles and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood decomposition search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single and parallel machine capacitated lotsizing and scheduling: new iterative MIP-based neighborhood search heuristics / 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: Variable neighbourhood decomposition search for \(0\)-\(1\) mixed integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simultaneous lotsizing and scheduling on parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: General variable neighborhood search for the continuous optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search for the cost constrained minimum label spanning tree and label constrained minimum spanning tree 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: An integer linear programming approach and a hybrid variable neighborhood search for the car sequencing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search for the degree-constrained minimum spanning tree problem / 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: Multi-stage simultaneous lot-sizing and scheduling for flow line production / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-level single machine lot-sizing and scheduling with zero lead times / rank
 
Normal rank

Latest revision as of 23:04, 12 July 2024

scientific article
Language Label Description Also known as
English
Combining the principles of variable neighborhood decomposition search and the Fix\&Optimize heuristic to solve multi-level lot-sizing and scheduling problems
scientific article

    Statements

    Combining the principles of variable neighborhood decomposition search and the Fix\&Optimize heuristic to solve multi-level lot-sizing and scheduling problems (English)
    0 references
    0 references
    0 references
    0 references
    11 November 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    GLSPMS
    0 references
    lot-sizing and scheduling
    0 references
    variable neighborhood decomposition search
    0 references
    VNDS
    0 references
    exchange
    0 references
    Fix\&Optimize
    0 references
    0 references
    0 references
    0 references