Multi-neighborhood based path relinking for two-sided assembly line balancing problem
From MaRDI portal
Publication:306088
DOI10.1007/s10878-015-9959-6zbMath1350.90020OpenAlexW2238171369MaRDI QIDQ306088
Zhaoyang Yang, Guo-Jun Zhang, Hai-Ping Zhu
Publication date: 31 August 2016
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-015-9959-6
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Two-sided assembly line balancing problem of type I: improvements, a simple algorithm and a comprehensive study ⋮ Comprehensive review and evaluation of heuristics and meta-heuristics for two-sided assembly line balancing problem ⋮ Minimizing the cycle time in two-sided assembly lines with assignment restrictions: improvements and a simple algorithm
Uses Software
Cites Work
- Unnamed Item
- A reactive GRASP with path relinking for capacitated clustering
- Ant algorithms for a time and space constrained assembly line balancing problem
- Multiple-criteria decision-making in two-sided assembly line balancing: a goal programming and a fuzzy goal programming model
- An improved shifting bottleneck procedure for the job shop scheduling problem
- Path relinking for unconstrained binary quadratic programming
- A station-oriented enumerative algorithm for two-sided assembly line balancing
- State-of-the-art exact and heuristic solution procedures for simple assembly line balancing
- Combining path relinking and genetic algorithms for the multiple-level warehouse layout problem
- A local search method for permutation flow shop scheduling
- ANTBAL: an ant colony optimization algorithm for balancing mixed-model assembly lines with parallel workstations
This page was built for publication: Multi-neighborhood based path relinking for two-sided assembly line balancing problem
