Pricing, relaxing and fixing under lot sizing and scheduling (Q2355959): 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.2013.04.030 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2021823347 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine multi-product capacitated lot sizing with sequence-dependent setups / rank
 
Normal rank
Property / cites work
 
Property / cites work: The prize collecting traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-and-Price: Column Generation for Solving Huge Integer Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity of the Capacitated Lot Size Problem / 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: Progressive Interval Heuristics for Multi-Item Capacitated Lot-Sizing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution approaches for the soft drink integrated production lot sizing and scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The general lotsizing and scheduling problem / 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: Modeling industrial lot sizing problems: a review / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lotsizing and Scheduling on Parallel Machines with Sequence-Dependent Setup Costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4139966 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacitated lot-sizing and scheduling with sequence-dependent, period-overlapping and non-triangular setups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simultaneous lotsizing and scheduling by combining local search with dual reoptimization / 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: Combination of Metaheuristic and Exact Algorithms for Solving Set Covering-Type Optimization 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: New formulation for the high multiplicity asymmetric traveling salesman problem with application to the Chesapeake problem / 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:29, 10 July 2024

scientific article
Language Label Description Also known as
English
Pricing, relaxing and fixing under lot sizing and scheduling
scientific article

    Statements

    Pricing, relaxing and fixing under lot sizing and scheduling (English)
    0 references
    0 references
    0 references
    0 references
    28 July 2015
    0 references
    lot sizing and scheduling
    0 references
    sequence-dependent setups
    0 references
    non-triangular setups
    0 references
    column generation
    0 references
    MIP-based heuristics
    0 references
    0 references

    Identifiers

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