Modeling lotsizing and scheduling problems with sequence dependent setups (Q297372): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q210413
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.2014.05.018 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2076622260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple machine continuous setup lotsizing with sequence-dependent setups / 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: Modelling Practical Lot-Sizing Problems as Mixed-Integer Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rolling-horizon lot-sizing when set-up times are sequence-dependent / 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 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: Pricing, relaxing and fixing under lot sizing and scheduling / 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: 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: A comparative analysis of several asymmetric traveling salesman problem formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacitated lot-sizing with extensions: a review / 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: MIP modelling of changeovers in production planning and scheduling problems / rank
 
Normal rank

Latest revision as of 06:22, 12 July 2024

scientific article
Language Label Description Also known as
English
Modeling lotsizing and scheduling problems with sequence dependent setups
scientific article

    Statements

    Modeling lotsizing and scheduling problems with sequence dependent setups (English)
    0 references
    0 references
    0 references
    0 references
    27 June 2016
    0 references
    production planning
    0 references
    lotsizing and scheduling
    0 references
    mixed-integer programming
    0 references
    sequence-dependent setups
    0 references
    computational benchmark
    0 references
    0 references

    Identifiers

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