Pages that link to "Item:Q4005791"
From MaRDI portal
The following pages link to Eureka: A Hybrid System for Assembly Line Balancing (Q4005791):
Displaying 24 items.
- Systematic data generation and test design for solution algorithms on the example of SALBPGen for assembly line balancing (Q257213) (← links)
- Ant algorithms for a time and space constrained assembly line balancing problem (Q857344) (← links)
- The sequence-dependent assembly line balancing problem (Q991824) (← links)
- Models for concurrent product and process design (Q1046061) (← 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 \(U\)-lines in a multiple \(U\)-line facility (Q1296689) (← links)
- Optimally balancing assembly lines with different workstations (Q1348257) (← links)
- Delivering complex decision rules to top level managers through decision support systems: A case study in army housing management. (Q1406640) (← links)
- Balancing assembly lines effectively -- a computational comparison (Q1809823) (← links)
- An enumerative heuristic and reduction methods for the assembly line balancing problem (Q1869496) (← links)
- U-shaped assembly line layouts and their impact on labor productivity: an experimental study (Q1877912) (← 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)
- 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)
- 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)
- An optimal piecewise-linear program for the U-line balancing problem with stochastic task times (Q2569065) (← 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)
- An improved mathematical program to solve the simple assembly line balancing problem (Q3055448) (← links)
