activity
20102026
most citedSimple heuristics for the assembly line worker assignment and balancing problem

81 citations · 98 across the 6 of their papers we have counts for

collaborators

7 papers

cs.ET2026

Sparse Walsh-Pauli Correlation Encoding for MaxCut: A Quantum-Inspired Formulation with Quantum-Hardware Validation

Cesar Augusto do Amaral, Nicolás Legnazzi, Marcos Vinicius Reballo +3

We introduce a sparse Walsh-Pauli correlation encoding for MaxCut, in which graph variables are represented by diagonal Pauli-string expectation values computed classically as norm…

cs.LG2026

A hybrid quantum-classical neural network for learning to route

Marcus Rolf Peter Ritt, Alexsandro Santos da Rosa Júnior, Marcos Vinicius Reballo +2

This work studies hybrid quantum-classical neural networks for learning routing heuristics. Specifically, this paper asks whether small quantum neural networks can replace paramete…

cs.AI2022

Understanding Sample Generation Strategies for Learning Heuristic Functions in Classical Planning

R. V. Bettker, P. P. Minini, A. G. Pereira +1

We study the problem of learning good heuristic functions for classical planning tasks with neural networks based on samples represented by states with their cost-to-goal estimates…

cs.AI2013★ 7 cited

Exact and Heuristic Methods for the Assembly Line Worker Assignment and Balancing Problem

Leonardo Borba, Marcus Ritt

In traditional assembly lines, it is reasonable to assume that task execution times are the same for each worker. However, in sheltered work centres for disabled this assumption is…

cs.DM2011

Improved integer programming models for simple assembly line balancing and related problems

Marcus Ritt, Alysson M. Costa

We propose a stronger formulation of the precedence constraints and the station limits for the simple assembly line balancing problem. The linear relaxation of the improved integer…

cs.CC2010★ 10 cited

Motion planning with pull moves

Marcus Ritt

It is well known that Sokoban is PSPACE-complete (Culberson 1998) and several of its variants are NP-hard (Demaine et al. 2003). In this paper we prove the NP-hardness of some vari…

cs.DS2010★ 81 cited

Simple heuristics for the assembly line worker assignment and balancing problem

Mayron César O. Moreira, Marcus Ritt, Alysson M. Costa +1

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 disabl…