Ant algorithms for a time and space constrained assembly line balancing problem

From MaRDI portal
Publication:857344

DOI10.1016/j.ejor.2005.12.017zbMath1109.90032OpenAlexW2067925095MaRDI QIDQ857344

Jordi Pereira, Joaquín Bautista

Publication date: 14 December 2006

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2005.12.017



Related Items

A classification of assembly line balancing problems, Heuristics and lower bounds for the simple assembly line balancing problem type 1: overview, computational tests and improvements, Assembly line balancing: what happened in the last fifteen years?, Multi-neighborhood based path relinking for two-sided assembly line balancing problem, Models for assembly line balancing by temporal, spatial and ergonomic risk attributes, New mathematical and constraint programming models for U-type assembly line balancing problems with assignment restrictions, Balancing a robotic spot welding manufacturing line: an industrial case study, Procedures for the time and space constrained assembly line balancing problem, Scheduling with time-dependent discrepancy times, Traveling worker assembly line (re)balancing problem: model, reduction techniques, and real case studies, A dynamic programming based heuristic for the assembly line balancing problem, Models for MMSP-W considering workstation dependencies: a case study of Nissan's Barcelona plant, Enhanced multi-hoffmann heuristic for efficiently solving real-world assembly line balancing problems in automotive industry, Solving mixed model sequencing problem in assembly lines with serial workstations with work overload minimisation and interruption rules, A Branch, Bound, and Remember Algorithm for the Simple Assembly Line Balancing Problem, \texttt{Absalom}: balancing assembly lines with assignment restrictions, An enumeration procedure for the assembly line balancing problem based on branching by non-decreasing idle time



Cites Work