- Wayne Pullan. Local search for the maximum k-plex problem. J. Heuristics, 27(3):303-324, 2021.
- Fan Yang, Roel Leus. Scheduling hybrid flow shops with time windows. J. Heuristics, 27(1):133-158, 2021.
- André Rossi, Alok Singh 0001, Marc Sevaux. Focus distance-aware lifetime maximization of video camera-based wireless sensor networks. J. Heuristics, 27(1):5-30, 2021.
- Federico Della Croce, Andrea Grosso, Fabio Salassa. Minimizing total completion time in the two-machine no-idle no-wait flow shop problem. J. Heuristics, 27(1):159-173, 2021.
- Philippe Grangier, Michel Gendreau, Fabien Lehuédé, Louis-Martin Rousseau. The vehicle routing problem with cross-docking and resource constraints. J. Heuristics, 27(1):31-61, 2021.
- Eduardo Queiroga, Rian G. S. Pinheiro, Quentin Christ, Anand Subramanian 0001, Artur Alves Pessoa. Iterated local search for single machine total weighted tardiness batch scheduling. J. Heuristics, 27(3):353-438, 2021.
- Hoang Huu Viet, Nguyen Thi Uyen, SeungGwan Lee, TaeChoong Chung, Le Hong Trang. A max-conflicts based heuristic search for the stable marriage problem with ties and incomplete lists. J. Heuristics, 27(3):439-458, 2021.
- Jonatas B. C. Chagas, Julian Blank, Markus Wagner 0007, Marcone J. F. Souza, Kalyanmoy Deb. A non-dominated sorting based customized random-key genetic algorithm for the bi-objective traveling thief problem. J. Heuristics, 27(3):267-301, 2021.
- Filipe Rodrigues 0002, Agostinho Agra, Lars Magnus Hvattum, Cristina Requejo. Weighted proximity search. J. Heuristics, 27(3):459-496, 2021.
- Javier Ferrer, Francisco Chicano, José Antonio Ortega-Toro. CMSA algorithm for solving the prioritized pairwise test data generation problem in software product lines. J. Heuristics, 27(1):229-249, 2021.