Student or educator? Sign up with your school email and get 6 months of Pro free.

The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.

Simple heuristics for the assembly line worker assignment and balancing problem

Open access
Moreira, Mayron César O., Ritt, Marcus, Costa, Alysson M., Chaves, Antonio A.·2012·Journal of Heuristics

Abstract

We propose simple heuristics for the assembly line worker assignment and balancing problem. This problem typically occurs in assembly lines in sheltered work centers for the disabled. Different from the well-known simple assembly line balancing problem, the task execution times vary according to the assigned worker. We develop a constructive heuristic framework based on task and worker priority rules defining the order in which the tasks and workers should be assigned to the workstations. We present a number of such rules and compare their performance across three possible uses: as a stand-alone method, as an initial solution generator for meta-heuristics, and as a decoder for a hybrid genetic algorithm. Our results show that the heuristics are fast, they obtain good results as a stand-alone method and are efficient when used as a initial solution generator or as a solution decoder within more elaborate approaches.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1007/s10732-012-9195-5

Cites

15 of 15 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 15 references

Research works printed but not linked: 4

  1. Chaves, A.A., Miralles, C., Lorena, L.A.N.: Clustering search approach for the assembly line worker assignment and balancing problem. In: Proc. of the 37th International Conference on Computers and Industrial Engineering, Alexandria, Egypt, pp. 1469–1478 (2007)
  2. Goldberg, D.E.: Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading (1989)
  3. Holland, J.H.: Adaptation in Natural and Artificial Systems. MIT Press, Cambridge (1975)
  4. Moreira, M.C.O., Costa, A.M.: A minimalist yet efficient tabu search for balancing assembly lines with disabled workers. In: Anais do XLI Simpósio Brasileiro de Pesquisa Operacional, Porto Seguro (2009)

Cited by

See all 95

Metadata

Authors
Moreira, M. C. O., Ritt, M., Costa, A. M., & Chaves, A. A.
Affiliations
  • Universidade de São Paulo (BR)
  • Universidade Federal do Rio Grande do Sul (BR)
  • Universidade Estadual Paulista (Unesp) (BR)
Corresponding author
Ritt, Marcus
Venue
Journal of Heuristics
Published
2012-02-29
Volume
18
Issue
3
Pages
505-524
ISSN
  • 1381-1231 (ISSN-L)
  • 1572-9397
OpenAlex
W1710954067
Cited by
95
References
15
Citations by year
2026: 2 · 2025: 1 · 2024: 14 · 2023: 4 · 2022: 8 · 2021: 10 · 2020: 5 · 2019: 4 · 2018: 10 · 2017: 3 · 2016: 6 · 2015: 10 · 2014: 5 · 2013: 5 · 2012: 7
FWCI
21.23
Type
journal article
Language
en
Open access
Licence
www.springer.com/tdm (tdm)
Locations
  • Journal of Heuristics (publishedVersion)
  • Scientific Electronic Library Online (São Paulo Research Foundation, Latin American and Caribbean Center on Health Sciences Information, Conselho Nacional de Desenvolvimento Científico e Tecnológico) (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • Acervo Digital da Universidade Estadual Paulista (Universidade Estadual Paulista) (submittedVersion)
  • UNESP Institutional Repository (São Paulo State University) (submittedVersion)
  • arXiv (Cornell University)
Topics
  • Physical Sciences › Engineering › Industrial and Manufacturing Engineering › Assembly Line Balancing Optimization
  • Physical Sciences › Engineering › Industrial and Manufacturing Engineering › Scheduling and Optimization Algorithms
  • Social Sciences › Decision Sciences › Management Science and Operations Research › Scheduling and Timetabling Solutions
Keywords
assembly line balancing, job assignment, disabled workers, constructive heuristics, initial solution generation, hybrid genetic algorithm

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Simple heuristics for the assembly line worker assignment and balancing problem. https://app.cochat.ai/papers/10.1007/s10732-012-9195-5
The paper
Moreira, M. C. O., Ritt, M., Costa, A. M., & Chaves, A. A. (2012). Simple heuristics for the assembly line worker assignment and balancing problem. Journal of Heuristics. https://doi.org/10.1007/s10732-012-9195-5

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.