Pages that link to "Item:Q1869496"
From MaRDI portal
The following pages link to An enumerative heuristic and reduction methods for the assembly line balancing problem (Q1869496):
Displaying 25 items.
- 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)
- Ant algorithms for a time and space constrained assembly line balancing problem (Q857344) (← links)
- A mathematical model and a genetic algorithm for two-sided assembly line balancing (Q955621) (← links)
- A dynamic programming based heuristic for the assembly line balancing problem (Q958561) (← links)
- A branch-and-bound algorithm to minimize the line length of a two-sided assembly line (Q976518) (← 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)
- A memetic algorithm for the cost-oriented robotic assembly line balancing problem (Q1654375) (← links)
- A branch, bound, and remember algorithm for the simple disassembly line balancing problem (Q1722962) (← links)
- SALSA: combining branch-and-bound with dynamic programming to smoothen workloads in simple assembly line balancing (Q2242373) (← links)
- Enhanced multi-hoffmann heuristic for efficiently solving real-world assembly line balancing problems in automotive industry (Q2256345) (← links)
- An enumeration procedure for the assembly line balancing problem based on branching by non-decreasing idle time (Q2355812) (← links)
- An application of the branch, bound, and remember algorithm to a new simple assembly line balancing dataset (Q2356246) (← links)
- A versatile algorithm for assembly line balancing (Q2383104) (← links)
- A station-oriented enumerative algorithm for two-sided assembly line balancing (Q2462138) (← links)
- Assembly line balancing and group working: a heuristic procedure for workers' groups operating on the same product and workstation (Q2489316) (← links)
- State-of-the-art exact and heuristic solution procedures for simple assembly line balancing (Q2569059) (← links)
- Generation of assembly graphs by systematic analysis of assembly structures (Q2569081) (← 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)
- Integrated planning for product module selection and assembly line design/reconfiguration (Q5478848) (← links)
- Analysis of the simple assembly line balancing problem complexity (Q6047869) (← links)
- R-SALSA: a branch, bound, and remember algorithm for the workload smoothing problem on simple assembly lines (Q6069213) (← links)