Pages that link to "Item:Q1091255"
From MaRDI portal
The following pages link to A two-process implicit enumeration algorithm for the simple assembly line balancing problem (Q1091255):
Displayed 9 items.
- \texttt{Absalom}: balancing assembly lines with assignment restrictions (Q1044086) (← links)
- A multiple-tree search procedure for the resource-constrained project scheduling problem (Q1266726) (← links)
- Maximizing the production rate in simple assembly line balancing -- A branch and bound procedure (Q1278226) (← links)
- Designing paced assembly lines with fixed number of stations (Q1291625) (← links)
- Balancing assembly lines effectively -- a computational comparison (Q1809823) (← links)
- Optimally solving the alternative subgraphs assembly line balancing problem (Q2267306) (← links)
- State-of-the-art exact and heuristic solution procedures for simple assembly line balancing (Q2569059) (← links)
- An linear programming based lower bound for the simple assembly line balancing problem (Q2569061) (← links)
- Improved methods of assembly sequence determination for automatic assembly systems (Q5935392) (← links)