Jorge M. S. Valente

27 papers Journal 26Unranked 1
YearRankTypeTitle / Venue / Authors
2024 J jnl
New heuristics for the 2-stage assembly scheduling problem with total earliness and tardiness minimisation: A computational evaluation.
Comput. Oper. Res.
Carla Talens, Jorge M. S. Valente, Victor Fernandez-Viagas
2022 J jnl
Metaheuristics for the permutation flowshop problem with a weighted quadratic tardiness objective.
Comput. Oper. Res.
Andréia F. Silva, Jorge M. S. Valente, Jeffrey E. Schaller
2022 J jnl
Scheduling in a no-wait flow shop to minimise total earliness and tardiness with additional idle time allowed.
Int. J. Prod. Res.
Jeffrey E. Schaller, Jorge M. S. Valente
2019 J jnl
Branch-and-bound algorithms for minimizing total earliness and tardiness in a two-machine permutation flow shop with unforced idle allowed.
Comput. Oper. Res.
Jeffrey E. Schaller, Jorge M. S. Valente
2019 J jnl
Heuristics for scheduling jobs in a permutation flow shop to minimize total earliness and tardiness with unforced idle time allowed.
Expert Syst. Appl.
Jeffrey E. Schaller, Jorge M. S. Valente
2018 J jnl
Efficient heuristics for minimizing weighted sum of squared tardiness on identical parallel machines.
Comput. Ind. Eng.
Jeffrey E. Schaller, Jorge M. S. Valente
2018 J jnl
Iterated-greedy-based algorithms with beam search initialization for the permutation flowshop to minimise total tardiness.
Expert Syst. Appl.
Victor Fernandez-Viagas, Jorge M. S. Valente, Jose M. Framiñan
2016 J jnl
Metaheuristics for the single machine weighted quadratic tardiness scheduling problem.
Comput. Oper. Res.
Tomás C. Gonçalves, Jorge M. S. Valente, Jeffrey E. Schaller
2013 J jnl
An evaluation of heuristics for scheduling a non-delay permutation flow shop with family setups to minimize total earliness and tardiness.
J. Oper. Res. Soc.
Jeffrey E. Schaller, Jorge M. S. Valente
2012 J jnl
Dispatching heuristics for the single machine weighted quadratic tardiness scheduling problem.
Comput. Oper. Res.
Jorge M. S. Valente, Jeffrey E. Schaller
2012 J jnl
Hybrid heuristics for the single machine scheduling problem with quadratic earliness and tardiness costs.
Int. J. Mach. Learn. Cybern.
Alok Singh, Jorge M. S. Valente, Maria do Rosário Alves Moreira
2012 J jnl
Minimizing the weighted sum of squared tardiness on a single machine.
Comput. Oper. Res.
Jeffrey E. Schaller, Jorge M. S. Valente
2010 J jnl
Beam search heuristics for quadratic earliness and tardiness scheduling.
J. Oper. Res. Soc.
Jorge M. S. Valente
2009 J jnl
A genetic algorithm approach for the single machine scheduling problem with linear earliness and quadratic tardiness penalties.
Comput. Oper. Res.
Jorge M. S. Valente, José Fernando Gonçalves
2009 J jnl
Beam Search Heuristics for the Single Machine Scheduling Problem with Linear earliness and Quadratic tardiness Costs.
Asia Pac. J. Oper. Res.
Jorge M. S. Valente
2009 — conf
Selection of Heuristics for the Job-Shop Scheduling Problem Based on the Prediction of Gaps in Machines.
LION
Pedro H. Abreu, Carlos Soares, Jorge M. S. Valente
2008 J jnl
An Exact Approach for the Single Machine Scheduling Problem with Linear Early and Quadratic tardy penalties.
Asia Pac. J. Oper. Res.
Jorge M. S. Valente
2008 J jnl
Beam search algorithms for the single machine total weighted tardiness scheduling problem with sequence-dependent setups.
Comput. Oper. Res.
Jorge M. S. Valente, Rui A. F. S. Alves
2008 J jnl
Beam search heuristics for the single machine early/tardy scheduling problem with no machine idle time.
Comput. Ind. Eng.
Jorge M. S. Valente
2008 J jnl
Heuristics for the single machine scheduling problem with quadratic earliness and tardiness penalties.
Comput. Oper. Res.
Jorge M. S. Valente, Rui A. F. S. Alves
2007 J jnl
Dispatching heuristics for the single machine early/tardy scheduling problem with job-independent penalties.
Comput. Ind. Eng.
Jorge M. S. Valente
2006 J jnl
A Hybrid Genetic Algorithm for the Early/tardy Scheduling Problem.
Asia Pac. J. Oper. Res.
Jorge M. S. Valente, José Fernando Gonçalves, Rui A. F. S. Alves
2006 J jnl
Local and global dominance conditions for the weighted earliness scheduling problem with no idle time.
Comput. Ind. Eng.
Jorge M. S. Valente
2005 J jnl
An exact approach to early/tardy scheduling with release dates.
Comput. Oper. Res.
Jorge M. S. Valente, Rui A. F. S. Alves
2005 J jnl
Filtered and recovering beam search algorithms for the early/tardy scheduling problem with no idle time.
Comput. Ind. Eng.
Jorge M. S. Valente, Rui A. F. S. Alves
2005 J jnl
Improved heuristics for the early/tardy scheduling problem with no idle time.
Comput. Oper. Res.
Jorge M. S. Valente, Rui A. F. S. Alves
2005 J jnl
Improved lower bounds for the early/tardy scheduling problem with no idle time.
J. Oper. Res. Soc.
Jorge M. S. Valente, Rui A. F. S. Alves