Shortest-route formulation of mixed-model assembly line balancing problem (Q1610143): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: A Survey of Exact Algorithms for the Simple Assembly Line Balancing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balancing Mixed Model Lines with In-Process Inventories / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for the Line Balancing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Programming Solution of Sequencing Problems with Precedence Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Sequencing by Modular Decomposition: Polynomial Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The mixed-model U-line balancing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed Model Line Balancing with Smoothed Station Assignments / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0377-2217(98)00115-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2067718231 / rank
 
Normal rank

Latest revision as of 10:31, 30 July 2024

scientific article
Language Label Description Also known as
English
Shortest-route formulation of mixed-model assembly line balancing problem
scientific article

    Statements

    Identifiers