Balancing \(U\)-lines in a multiple \(U\)-line facility (Q1296689): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: Wikidata QID (P12): Q127673583, #quickstatements; #temporary_batch_1722203565125
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
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: Fast, Effective Algorithms for Simple Assembly Line Balancing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eureka: A Hybrid System for Assembly Line Balancing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3206647 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The U-line Line Balancing Problem / 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: The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of dynamic programming for sequencing problems with precedence constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Integer Programming Algorithm with Network Cuts for Solving the Assembly Line Balancing Problem / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127673583 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:56, 28 July 2024

scientific article
Language Label Description Also known as
English
Balancing \(U\)-lines in a multiple \(U\)-line facility
scientific article

    Statements

    Identifiers