Pages that link to "Item:Q2569061"
From MaRDI portal
The following pages link to An linear programming based lower bound for the simple assembly line balancing problem (Q2569061):
Displaying 11 items.
- Procedures for the bin packing problem with precedence constraints (Q322561) (← links)
- A heuristic and a branch-and-bound algorithm for the assembly line worker assignment and balancing problem (Q336970) (← links)
- Procedures for the time and space constrained assembly line balancing problem (Q421558) (← links)
- Optimization framework for process scheduling of operation-dependent automobile assembly lines (Q691498) (← links)
- The sequence-dependent assembly line balancing problem (Q991824) (← links)
- A memetic algorithm for the cost-oriented robotic assembly line balancing problem (Q1654375) (← 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)
- Bin Packing Problem with Time Lags (Q5106420) (← links)
- A new upper bound based on Dantzig-Wolfe decomposition to maximize the stability radius of a simple assembly line under uncertainty (Q6555181) (← links)
- A branch, bound and remember algorithm for maximizing the production rate in the simple assembly line balancing problem (Q6568392) (← links)
