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 accessAbstract
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.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Genetic Algorithms and Random Keys for Sequencing and Optimization
Bean, J. C. (1994) · INFORMS journal on computing · doi:10.1287/ijoc.6.2.154 · Cited by 1,543 · cited 1×
“Bean (1994) introduced random-key genetic algorithms (RKGA).”
A Survey of Exact Algorithms for the Simple Assembly Line Balancing Problem
Baybars, İ. (1986) · Management Science · doi:10.1287/mnsc.32.8.909 · Cited by 1,040
A classification of assembly line balancing problems
Boysen, N., Fliedner, M., & Schöll, A. (2006) · European Journal of Operational Research · doi:10.1016/j.ejor.2006.10.010 · Cited by 888 · cited 1×
“For more details on SALBP and many of its variants, we refer the reader to Baybars (1986), Scholl (1999), Scholl and Becker (2006), Boysen et al. (2007, 2008).”
BackgroundState-of-the-art exact and heuristic solution procedures for simple assembly line balancing
Schöll, A., & Becker, C. (2004) · European Journal of Operational Research · doi:10.1016/j.ejor.2004.07.022 · Cited by 879 · cited 3×
“For more details on SALBP and many of its variants, we refer the reader to Baybars (1986), Scholl (1999), Scholl and Becker (2006), Boysen et al. (2007, 2008).”
BackgroundMethodBalancing and Sequencing of Assembly Lines
Schöll, A. (1999) · Contributions to management science · doi:10.1007/978-3-662-11223-6 · Cited by 752
Assembly line balancing: Which model to use when?
Boysen, N., Fliedner, M., & Schöll, A. (2007) · International Journal of Production Economics · doi:10.1016/j.ijpe.2007.02.026 · Cited by 583 · cited 2×
“Table 3 compares the results of the HGA with the clustering search (CS) of Chaves et al. (2009), the tabu search (TS) of Moreira and Costa (2009), and the iterated beam search (IBS) of Blum and Miralles (2011).”
BackgroundMethodA Comparative Evaluation of Heuristic Line Balancing Techniques
Talbot, F. B., Patterson, J. H., & Gehrlein, W. V. (1986) · Management Science · doi:10.1287/mnsc.32.4.430 · Cited by 296 · cited 1×
“For the SALBP, it is known that breaking ties between tasks of the same priority can have a significant effect on the solution quality (Talbot et al. 1986).”
BackgroundA random key based genetic algorithm for the resource constrained project scheduling problem
Mendes, J. J. D. M., Gonçalves, J. F., & Resende, M. G. C. (2007) · Computers & Operations Research · doi:10.1016/j.cor.2007.07.001 · Cited by 273 · cited 1×
“Random-key genetic algorithms are particularly useful for sequencing problems, and have been proposed by Gonçalves and de Almeida (2004) for the SALBP-1 and, by Mendes et al. (2009) for resource constrained project scheduling.”
BackgroundSimple assembly line balancing?Heuristic approaches
Schöll, A., & Voß, S. (1997) · Journal of Heuristics · doi:10.1007/bf00127358 · Cited by 218 · cited 6×
“Scholl and Voß (1996) where E i and L i are the earliest and latest workstations (defined in Sect.”
BackgroundMethodInfluentialA Hybrid Genetic Algorithm for Assembly Line Balancing
Gonçalves, J. F., & de Almeida, J. R. (2002) · Journal of Heuristics · doi:10.1023/a:1020377910258 · Cited by 205 · cited 1×
“Random-key genetic algorithms are particularly useful for sequencing problems, and have been proposed by Gonçalves and de Almeida (2004) for the SALBP-1 and, by Mendes et al. (2009) for resource constrained project scheduling.”
BackgroundMiralles, C., Garcia-Sabater, J. P., Andrés, C., & Cardós, M. (2007) · Discrete Applied Mathematics · doi:10.1016/j.dam.2005.12.012 · Cited by 180 · cited 3×
“The difficulty in solving this model has been reported in the literature (Miralles et al. 2008) and motivates the search for efficient heuristic methods like the constructive heuristics presented in the following section.”
BackgroundMethodInfluentialAdvantages of assembly lines in Sheltered Work Centres for Disabled. A case study
Miralles, C., Garcia-Sabater, J. P., Andrés, C., & Cardós, M. (2007) · International Journal of Production Economics · doi:10.1016/j.ijpe.2007.02.023 · Cited by 159 · cited 2×
“The ALWABP has been introduced in the literature by Miralles et al. (2007) by means of a case study in an assembly line of a Spanish sheltered work center for the disabled where a fixed number of workers should be present in an assembly line whose production rate should be maximized (ALWABP-2).”
MethodKlein, R., & Schöll, A. (1999) · European Journal of Operational Research · doi:10.1016/s0377-2217(97)00442-6 · Cited by 152 · cited 1×
“LC1 and LC2 are defined as The bound LC3 is obtained by destructive improvement (Klein and Scholl 1999) using bounds on the earliest station E i (c) and latest station L i (c) for each task i , and is defined as the smallest c greater than or equal to an initial lower bound c such that E i (c) ≤ L i…”
BackgroundOn solving the assembly line worker assignment and balancing problem via beam search
Blum, C., & Miralles, C. (2010) · Computers & Operations Research · doi:10.1016/j.cor.2010.05.008 · Cited by 129 · cited 5×
“Table 3 compares the results of the HGA with the clustering search (CS) of Chaves et al. (2009), the tabu search (TS) of Moreira and Costa (2009), and the iterated beam search (IBS) of Blum and Miralles (2011).”
BackgroundMethodInfluentialHybrid Metaheuristic for the Assembly Line Worker Assignment and Balancing Problem
Chaves, A. A., Lorena, L. A. N., & Miralles, C. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-04918-7_1 · Cited by 61 · cited 5×
“…is compared by means of computational tests to evaluate its performance both as a stand-alone method as well as its ability to improve the convergence of more sophisticated meth-ods such as the aforementioned clustering search and tabu search algorithms (Chaves et al. 2009; Moreira and Costa 2009).”
MethodResultInfluentialSelf-citation
Research works printed but not linked: 4
- 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)
- Goldberg, D.E.: Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading (1989)
- Holland, J.H.: Adaptation in Natural and Artificial Systems. MIT Press, Cambridge (1975)
- 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
Assembly line balancing: What happened in the last fifteen years?
Boysen, N., Schulze, P., & Schöll, A. (2021) · European Journal of Operational Research · doi:10.1016/j.ejor.2021.11.043 · Cited by 309
A branch-and-bound algorithm for assembly line worker assignment and balancing problems
Vilà, M., & Pereira, J. (2013) · Computers & Operations Research · doi:10.1016/j.cor.2013.10.016 · Cited by 133
“The resulting procedure is capable of optimally solving type-2 instances from the reference set with up to 75 tasks, and it reports better solutions than previous heuristics and exact algorithms if the search is truncated by using a time limit.”
BackgroundMethodResultInfluentialBiased random-key genetic algorithms: A review
Londe, M. A., Pessôa, L. F., Andrade, C. E., & Resende, M. G. C. (2024) · European Journal of Operational Research · doi:10.1016/j.ejor.2024.03.030 · Cited by 119
Borba, L., & Ritt, M. (2013) · Computers & Operations Research · doi:10.1016/j.cor.2013.12.002 · Cited by 117
Self-citationMutlu, Ö., Polat, O., & Supçiller, A. A. (2012) · Computers & Operations Research · doi:10.1016/j.cor.2012.07.010 · Cited by 117
“[4] proposed a constructive heuristic methods for the ALWABP types based on the constructive heuristic for the SALBP-2 presented by Scholl and Voß [17].”
Method
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
- ORCID
- 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
- green
- arxiv.org
- 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
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.