A forward branch-and-search algorithm and forecast horizon results for the changeover scheduling problem (Q1278236): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0377-2217(95)00074-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2032946335 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Task Sequencing with Deadlines, Set-Up Times and Changeover Costs / 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: Rolling Planning Horizons: Error Bounds for the Dynamic Lot Size Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planning Horizons for the Dynamic Lot Size Model: Zabel vs. Protective Procedures and Computational Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimum Production Scheduling of Multicommodity in Flow Line / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Extensions of the Discrete Lotsizing and Scheduling Problem / rank
 
Normal rank

Latest revision as of 18:30, 28 May 2024

scientific article
Language Label Description Also known as
English
A forward branch-and-search algorithm and forecast horizon results for the changeover scheduling problem
scientific article

    Statements