Cristóbal Miralles

TL;DR: The problem presented in this paper adds sequence-dependent setup time considerations to the classical SALBP in the following way: whenever a task is assigned next to another at the same workstation, a setup time must be added to compute the global workstation time.

TL;DR: This paper shows one of the possible real applications where Operations Research can help not only to get economic and productive benefits but also certain social aims, and proposes the use of a Branch and Bound-based heuristic for large problems.

TL;DR: It is revealed how the traditional division of work in single tasks, typical in assembly lines, becomes a perfect tool for making certain worker disabilities invisible, providing new jobs for disabled people; always taking into account certain special constraints that are analysed.

TL;DR: An algorithm based on beam search for solving the ALWABP with the objective of minimizing the cycle time when given a fixed number of work stations, respectively, workers is introduced.

TL;DR: A metric along with a mixed integer linear model and a heuristic decomposition method are proposed to solve this new job rotation problem in the assembly line worker assignment and balancing problem.