Minimizing the cycle time in two-sided assembly lines with assignment restrictions: improvements and a simple algorithm

DOI10.1155/2016/4536426zbMath1400.90160OpenAlexW2467911610WikidataQ59131341 ScholiaQ59131341MaRDI QIDQ1793174

Qiuhua Tang, Zixiang Li, Li-Ping Zhang

Publication date: 12 October 2018

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2016/4536426

Mathematics Subject Classification ID

Mixed integer programming (90C11) Production models (90B30)

Related Items (3)

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 ⋮ Branch, bound and remember algorithm for two-sided assembly line balancing problem

Uses Software

• TUALB
• 2-ANTBAL

Cites Work

• Multi-neighborhood based path relinking for two-sided assembly line balancing problem
• An effective hybrid honey bee mating optimization algorithm for balancing mixed-model two-sided assembly lines
• Variable neighborhood search for the second type of two-sided assembly line balancing problem
• A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
• A mathematical model and a genetic algorithm for two-sided assembly line balancing
• A branch-and-bound algorithm to minimize the line length of a two-sided assembly line
• Bees algorithm for constrained fuzzy multi-objective two-sided assembly line balancing problem
• Two-sided assembly lines balancing with assignment restrictions
• Balancing stochastic two-sided assembly lines: a chance-constrained, piecewise-linear, mixed integer program and a simulated annealing algorithm
• A station-oriented enumerative algorithm for two-sided assembly line balancing
• An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives
• Total tardiness minimization in permutation flow shops: a simple approach based on a variable greedy algorithm
• Balancing assembly lines: an industrial case study

This page was built for publication: Minimizing the cycle time in two-sided assembly lines with assignment restrictions: improvements and a simple algorithm