Pages that link to "Item:Q2355812"
From MaRDI portal
The following pages link to An enumeration procedure for the assembly line balancing problem based on branching by non-decreasing idle time (Q2355812):
Displaying 11 items.
- Hybrid metaheuristics for the accessibility windows assembly line balancing problem level 2 (AWALBP-L2) (Q322556) (← links)
- Procedures for the bin packing problem with precedence constraints (Q322561) (← links)
- Exact and heuristic methods for solving the robotic assembly line balancing problem (Q1754736) (← links)
- Developing optimization \& robust models for a mixed-model assembly line balancing problem with semi-automated operations (Q1984875) (← links)
- Assembly line balancing: what happened in the last fifteen years? (Q2140264) (← links)
- Branch, bound and remember algorithm for two-sided assembly line balancing problem (Q2178119) (← links)
- A branch-and-bound algorithm for assembly line worker assignment and balancing problems (Q2257352) (← 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)
- Analysis of the simple assembly line balancing problem complexity (Q6047869) (← links)
- A branch, bound and remember algorithm for maximizing the production rate in the simple assembly line balancing problem (Q6568392) (← links)
