Pages that link to "Item:Q1178719"
From MaRDI portal
The following pages link to Finding optimal line balances with OptPack (Q1178719):
Displaying 14 items.
- An efficient branch and bound algorithm for assembly line balancing problems with parallel multi-manned workstations (Q339701) (← links)
- Balancing assembly lines with variable parallel workplaces: problem definition and effective solution procedure (Q1042153) (← links)
- \texttt{Absalom}: balancing assembly lines with assignment restrictions (Q1044086) (← links)
- Designing paced assembly lines with fixed number of stations (Q1291625) (← links)
- Optimally balancing assembly lines with different workstations (Q1348257) (← links)
- Balancing assembly lines effectively -- a computational comparison (Q1809823) (← links)
- An enumerative heuristic and reduction methods for the assembly line balancing problem (Q1869496) (← links)
- Branch, bound and remember algorithm for two-sided assembly line balancing problem (Q2178119) (← links)
- An application of the branch, bound, and remember algorithm to a new simple assembly line balancing dataset (Q2356246) (← 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)
- Heuristics and lower bounds for the simple assembly line balancing problem type 1: overview, computational tests and improvements (Q2629595) (← links)
- Enhanced branch-bound-remember and iterative beam search algorithms for type II assembly line balancing problem (Q2668676) (← links)
- A Branch, Bound, and Remember Algorithm for the Simple Assembly Line Balancing Problem (Q2815457) (← links)
