The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times (Q706984): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.cor.2003.08.014 / rank
Normal rank
 
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.cor.2003.08.014 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1997722319 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Deterministic Dynamic Product Cycling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cutting plane approach to capacitated lot-sizing with start-up costs / 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: Solving the discrete lotsizing and scheduling problem with sequence dependent set-up costs and set-up times using the travelling salesman problem with time windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: MIP modelling of changeovers in production planning and scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling salesman problem: An overview of exact and approximate algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The vehicle routing problem: An overview of exact and approximate algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong Formulations for Multi-Item Capacitated Lot Sizing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rounding Off to Powers of Two in Continuous Relaxations of Capacitated Lot Sizing Problems / 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: Capacitated lot sizing under setup learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: A framework for modelling setup carryover in the capacitated lot sizing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacitated lot-sizing with sequence dependent setup costs / 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: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for Row-Aggregation in Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: LP-based heuristics for the capacitated lot-sizing problem: The interaction of model formulation and solution algorithm / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.COR.2003.08.014 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 01:22, 10 December 2024

scientific article
Language Label Description Also known as
English
The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times
scientific article

    Statements

    The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times (English)
    0 references
    0 references
    0 references
    9 February 2005
    0 references
    Lot-sizing
    0 references
    Sequence-dependent
    0 references
    Sequencing
    0 references
    Scheduling
    0 references
    Relaxation
    0 references
    Heuristic
    0 references

    Identifiers