Filtered and recovering beam search algorithms for the early/tardy scheduling problem with no idle time. - Jorge M. S. Valente; Rui A. F. S. Alves (Comput. Ind. Eng., 2005)

Improved heuristics for the early/tardy scheduling problem with no idle time. - Jorge M. S. Valente; Rui A. F. S. Alves (Comput. Oper. Res., 2005)

An exact approach to early/tardy scheduling with release dates. - Jorge M. S. Valente; Rui A. F. S. Alves (Comput. Oper. Res., 2005)

Improved lower bounds for the early/tardy scheduling problem with no idle time. - Jorge M. S. Valente; Rui A. F. S. Alves (J. Oper. Res. Soc., 2005)

A Hybrid Genetic Algorithm for the Early/tardy Scheduling Problem. - Jorge M. S. Valente; José Fernando Gonçalves; Rui A. F. S. Alves (Asia Pac. J. Oper. Res., 2006)

Local and global dominance conditions for the weighted earliness scheduling problem with no idle time. - Jorge M. S. Valente (Comput. Ind. Eng., 2006)

Dispatching heuristics for the single machine early/tardy scheduling problem with job-independent penalties. - Jorge M. S. Valente (Comput. Ind. Eng., 2007)

An Exact Approach for the Single Machine Scheduling Problem with Linear Early and Quadratic tardy penalties. - Jorge M. S. Valente (Asia Pac. J. Oper. Res., 2008)

Beam search heuristics for the single machine early/tardy scheduling problem with no machine idle time. - Jorge M. S. Valente (Comput. Ind. Eng., 2008)

Beam search algorithms for the single machine total weighted tardiness scheduling problem with sequence-dependent setups. - Jorge M. S. Valente; Rui A. F. S. Alves (Comput. Oper. Res., 2008)

Heuristics for the single machine scheduling problem with quadratic earliness and tardiness penalties. - Jorge M. S. Valente; Rui A. F. S. Alves (Comput. Oper. Res., 2008)

Selection of Heuristics for the Job-Shop Scheduling Problem Based on the Prediction of Gaps in Machines. - Pedro H. Abreu; Carlos Soares; Jorge M. S. Valente (LION, 2009)

Beam Search Heuristics for the Single Machine Scheduling Problem with Linear earliness and Quadratic tardiness Costs. - Jorge M. S. Valente (Asia Pac. J. Oper. Res., 2009)

A genetic algorithm approach for the single machine scheduling problem with linear earliness and quadratic tardiness penalties. - Jorge M. S. Valente; José Fernando Gonçalves (Comput. Oper. Res., 2009)

Beam search heuristics for quadratic earliness and tardiness scheduling. - Jorge M. S. Valente (J. Oper. Res. Soc., 2010)

Minimizing the weighted sum of squared tardiness on a single machine. - Jeffrey E. Schaller; Jorge M. S. Valente (Comput. Oper. Res., 2012)

Dispatching heuristics for the single machine weighted quadratic tardiness scheduling problem. - Jorge M. S. Valente; Jeffrey E. Schaller (Comput. Oper. Res., 2012)

Hybrid heuristics for the single machine scheduling problem with quadratic earliness and tardiness costs. - Alok Singh 001; Jorge M. S. Valente; Maria do Rosário Alves Moreira (Int. J. Mach. Learn. Cybern., 2012)

An evaluation of heuristics for scheduling a non-delay permutation flow shop with family setups to minimize total earliness and tardiness. - Jeffrey E. Schaller; Jorge M. S. Valente (J. Oper. Res. Soc., 2013)

Metaheuristics for the single machine weighted quadratic tardiness scheduling problem. - Tomás C. Gonçalves; Jorge M. S. Valente; Jeffrey E. Schaller (Comput. Oper. Res., 2016)

Efficient heuristics for minimizing weighted sum of squared tardiness on identical parallel machines. - Jeffrey E. Schaller; Jorge M. S. Valente (Comput. Ind. Eng., 2018)

Iterated-greedy-based algorithms with beam search initialization for the permutation flowshop to minimise total tardiness. - Victor Fernandez-Viagas; Jorge M. S. Valente; Jose M. Framiñan (Expert Syst. Appl., 2018)

Branch-and-bound algorithms for minimizing total earliness and tardiness in a two-machine permutation flow shop with unforced idle allowed. - Jeffrey E. Schaller; Jorge M. S. Valente (Comput. Oper. Res., 2019)

Heuristics for scheduling jobs in a permutation flow shop to minimize total earliness and tardiness with unforced idle time allowed. - Jeffrey E. Schaller; Jorge M. S. Valente (Expert Syst. Appl., 2019)

Metaheuristics for the permutation flowshop problem with a weighted quadratic tardiness objective. - Andréia F. Silva; Jorge M. S. Valente; Jeffrey E. Schaller (Comput. Oper. Res., 2022)

Scheduling in a no-wait flow shop to minimise total earliness and tardiness with additional idle time allowed. - Jeffrey E. Schaller; Jorge M. S. Valente (Int. J. Prod. Res., 2022)

New heuristics for the 2-stage assembly scheduling problem with total earliness and tardiness minimisation: A computational evaluation. - Carla Talens; Jorge M. S. Valente; Victor Fernandez-Viagas (Comput. Oper. Res., 2024)