A framework for modelling setup carryover in the capacitated lot sizing problem (Q4399025): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1080/00207549508904793 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2018911891 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dual Ascent and Column Generation Heuristic for the Discrete Lotsizing and Scheduling Problem with Setup Times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Change-Over Scheduling of Several Products on One Machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dynamic Programming Solution to the Dynamic, Multi-Item, Single-Machine Scheduling Problem / 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: Facets and algorithms for capacitated lot sizing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Multi-Item Lot-Sizing Problems Using Strong Cutting Planes / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:25, 28 May 2024

scientific article; zbMATH DE number 1179715
Language Label Description Also known as
English
A framework for modelling setup carryover in the capacitated lot sizing problem
scientific article; zbMATH DE number 1179715

    Statements

    Identifiers