Extensions of the dynamic programming method in the deterministic and stochastic assembly-line balancing problems
From MaRDI portal
Publication:1821677
DOI10.1016/0305-0548(86)90032-8zbMath0616.90026OpenAlexW1967980475MaRDI QIDQ1821677
Publication date: 1986
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0305-0548(86)90032-8
assembly-line balancing problemnondominated pairs of cycle time and number of stationsstochastic case
Related Items (10)
A classification of assembly line balancing problems ⋮ Second order conic approximation for disassembly line design with joint probabilistic constraints ⋮ Balancing stochastic parallel assembly lines ⋮ Stochastic assembly line balancing: general bounds and reliability-based branch-and-bound algorithm ⋮ Empirical working time distribution-based line balancing with integrated simulated annealing and dynamic programming ⋮ Balancing stochastic two-sided assembly lines: a chance-constrained, piecewise-linear, mixed integer program and a simulated annealing algorithm ⋮ A multiple criteria decision making approach for the assembly line balancing problem ⋮ A survey on problems and methods in generalized assembly line balancing ⋮ An optimal piecewise-linear program for the U-line balancing problem with stochastic task times ⋮ A knowledge-based system for solving multi-objective assembly line balancing problems
Cites Work
- Unnamed Item
- Assembly line balancing as generalized bin packing
- On Dynamic Programming Methods for Assembly Line Balancing
- A Preference Order Dynamic Program for Stochastic Assembly Line Balancing
- Assembly-Line Balancing—Dynamic Programming with Precedence Constraints
- An Algorithm for the Line Balancing Problem
- An Experimental Investigation and Comparative Evaluation of Production Line Balancing Techniques
This page was built for publication: Extensions of the dynamic programming method in the deterministic and stochastic assembly-line balancing problems
