Basic implementation of the Hoffmann heuristic and other related methods for the SALBP
Repository with an easy-to-follow implementation of some basic heuristics for the SALBP including the Hoffmann heuristic. I use it to teach some basic programming skills to my graduate students.
Github repository: github.com/jordipereiragude/salbpbasics.
Cost-oriented robotic assembly line balancing problem
The instances used in "Pereira, J and Ritt, M and Vásquez, O. A memetic algorithm for the cost-oriented robotic assembly line balancing problem, Computers and Operations Research 99, 249--261, 2019" are available in the following webpage: http://www.inf.ufrgs.br/algopt/coal/.
The link contains some code to format the tables.
Pairwise connection instances
The instances used in "Averbakh, I., and Pereira, J., Lateness minimization in pairwise connectivity restoration problems, INFORMS Journal on Computing 30, 522-538, 2018" are available in github.
Github repository: github.com/jordipereiragude/pairwiseConnectionInstances.
Flowtime network construction problem instances
The instances used in "Averbakh, I., and Pereira, J., The flowtime network construction problem, IIE Transactions 44, 681-694, 2012" are available in github.
Github repository: github.com/jordipereiragude/flowtimenetworkconstructioninstances.
Source code for "A note on Algorithms for the Calzedonia workload allocation problem"
The source code reported in "Pereira, J., and Ritt, M., A note on "Algorithms for the Calzedonia workload allocation problem", Journal of the Operational Research Society (doi:10.1080/01605682.2021.1895685)" is available in github.
Github repository: github.com/jordipereiragude/dpworkwerallocation.
Source code and instances for "Exact and heuristic methods for a workload allocation problem with chain precedence constraints"
Source code, instances and results reported in "Pereira, J., and Ritt, M., A note on "Algorithms for the Calzedonia workload allocation problem", European Journal of Operational Research (doi:10.1016/j.ejor.2022.12.035)" is available in github.
Github repository: github.com/jordipereiragude/workload_allocation_chains.
Instances for "Analysis of the simple assembly line balancing problem complexity"
Instance generator for the SALBP-1 discussed in "Álvarez-Miranda, E., Pereira, J., and Vilà, M., Analysis of the simple assembly line balancing problem complexity, Computers and Operations Research (doi:10.1016/j.cor.2023.106323)" is available in github.
Github repository: github.com/jordipereiragude/salbp1-instances.
BBR code for "Analysis of the simple assembly line balancing problem complexity"
BBR code reported in "Álvarez-Miranda, E., Pereira, J., and Vilà, M., Analysis of the simple assembly line balancing problem complexity, Computers and Operations Research (doi:10.1016/j.cor.2023.106323)" is available in github. The code solves some issues from the SALBP-1 BBR code by Morrison.
Github repository: github.com/jordipereiragude/bbr-salbp.
Instances for "A branch, bound and remember algorithm for maximizing the production rate in the simple assembly line balancing problem"
Instance generator for the SALBP-2 discussed in "Álvarez-Miranda, E., Pereira, J., and Vilà, M., A branch, bound and remember algorithm for maximizing the production rate in the simple assembly line balancing problem, Computers and Operations Research (doi:10.1016/j.cor.2024.106597)" is available in github.
Github repository: github.com/jordipereiragude/salbp2instances.