Workload smoothing in simple assembly line balancing
From MaRDI portal
Publication:1652443
DOI10.1016/j.cor.2017.08.006zbMath1391.90214OpenAlexW2748823108MaRDI QIDQ1652443
Sadullah İmat, Azizoglu, Meral
Publication date: 11 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2017.08.006
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Production models (90B30) Combinatorial optimization (90C27)
Related Items
A novel two-stage framework for reducing ergonomic risks of a mixed-model parallel U-shaped assembly-line, Assembly line balancing: what happened in the last fifteen years?, Integrated real-time control of mixed-model assembly lines and their part feeding processes, R-SALSA: a branch, bound, and remember algorithm for the workload smoothing problem on simple assembly lines, SALSA: combining branch-and-bound with dynamic programming to smoothen workloads in simple assembly line balancing, A fast and effective heuristic for smoothing workloads on assembly lines: algorithm design and experimental analysis, A note on ``Workload smoothing in simple assembly line balancing
Cites Work
- Using the Taguchi method to optimize the differential evolution algorithm parameters for minimizing the workload smoothness index in simple assembly line balancing
- A classification of assembly line balancing problems
- State-of-the-art exact and heuristic solution procedures for simple assembly line balancing
- A Survey of Exact Algorithms for the Simple Assembly Line Balancing Problem
- Technical Note—Assembly-Line Balancing: Zero-One Programming with Fibonacci Search
