Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
×
This paper discusses approaches for coding a preference order dynamic programming algorithm for solving an assembly line balancing problem with stochastic ...
People also ask
An approach for solving the problem using the simulated annealing technique is presented here. The proposed approach tries to reach the global optimum by not ...
Missing: Computational | Show results with:Computational
We present two dynamic programming (DP) algorithms for this problem, each guaranteed to be optimal under a certain mild condition. Our general approach is based ...
The present work defines the reliability of the assembly line in terms of cycle time and distribution of the tasks times and offers an optimization formulation ...
Consider an assembly line balancing problem with stochastic task times. Our objective is to find a grouping of tasks into stations that satisfies all ...
The study adopts the methodology of stochastic modelling, whereby various probability distributions are integrated within a modified COMSOAL algorithm, as a ...
Missing: Computational | Show results with:Computational
Computational experiments show that stochastic modeling can help ... “A single-run optimization algorithm for stochastic assembly line balancing problems.
In this survey paper we discuss the development of the simple assembly line balancing problem (SALBP); modifications and generalizations over time; ...
Many heuristics have been proposed for the assembly line balancing problem due to its computational complexity and difficulty in identifying an optimal ...
Proposed TS algorithm is evaluated on a set of newly generated benchmark problems. Abstract. In industrial systems, efficient design of production units is ...