A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines (Q2433465): Difference between revisions

From MaRDI portal
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.2005.06.029 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2071304493 / 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: Modelling Practical Lot-Sizing Problems as Mixed-Integer Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4133397 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Economic Lot Scheduling for Multiple Products on Parallel Identical Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4105990 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacitated lot-sizing and scheduling by Lagrangean relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lagrangean Relaxation Approach for Very-Large-Scale Capacitated Lot-Sizing / 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: A Tabu-Search Heuristic for the Capacitated Lot-Sizing Problem with Set-up Carryover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Validation of subgradient optimization / 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: Solving mixed integer programming production planning problems with setups by shadow price information. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved lower bounds for the capacitated lot sizing problem with setup times. / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Algorithm for Multi-Item Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-dual approach to the single level capacitated lot-sizing problem / 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: A single-product parallel-facilities production-planning model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-item capacitated lot-sizing by a cross decomposition based algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cross decomposition for mixed integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Version of the Economic Lot Size Model / 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 22:23, 24 June 2024

scientific article
Language Label Description Also known as
English
A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines
scientific article

    Statements

    A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines (English)
    0 references
    27 October 2006
    0 references
    0 references
    heuristics
    0 references
    lot-sizing
    0 references
    parallel machines
    0 references
    Lagrangian relaxation
    0 references
    0 references
    0 references
    0 references