Jorge M. S. Valente

Orcid: 0000-0001-5917-8880

According to our database1, Jorge M. S. Valente authored at least 26 papers between 2005 and 2022.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Scheduling in a no-wait flow shop to minimise total earliness and tardiness with additional idle time allowed.
Int. J. Prod. Res., 2022

Metaheuristics for the permutation flowshop problem with a weighted quadratic tardiness objective.
Comput. Oper. Res., 2022

2019
Heuristics for scheduling jobs in a permutation flow shop to minimize total earliness and tardiness with unforced idle time allowed.
Expert Syst. Appl., 2019

Branch-and-bound algorithms for minimizing total earliness and tardiness in a two-machine permutation flow shop with unforced idle allowed.
Comput. Oper. Res., 2019

2018
Iterated-greedy-based algorithms with beam search initialization for the permutation flowshop to minimise total tardiness.
Expert Syst. Appl., 2018

Efficient heuristics for minimizing weighted sum of squared tardiness on identical parallel machines.
Comput. Ind. Eng., 2018

2016
Metaheuristics for the single machine weighted quadratic tardiness scheduling problem.
Comput. Oper. Res., 2016

2013
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., 2013

2012
Hybrid heuristics for the single machine scheduling problem with quadratic earliness and tardiness costs.
Int. J. Mach. Learn. Cybern., 2012

Dispatching heuristics for the single machine weighted quadratic tardiness scheduling problem.
Comput. Oper. Res., 2012

Minimizing the weighted sum of squared tardiness on a single machine.
Comput. Oper. Res., 2012

2010
Beam search heuristics for quadratic earliness and tardiness scheduling.
J. Oper. Res. Soc., 2010

2009
A genetic algorithm approach for the single machine scheduling problem with linear earliness and quadratic tardiness penalties.
Comput. Oper. Res., 2009

Beam Search Heuristics for the Single Machine Scheduling Problem with Linear earliness and Quadratic tardiness Costs.
Asia Pac. J. Oper. Res., 2009

Selection of Heuristics for the Job-Shop Scheduling Problem Based on the Prediction of Gaps in Machines.
Proceedings of the Learning and Intelligent Optimization, Third International Conference, 2009

2008
Heuristics for the single machine scheduling problem with quadratic earliness and tardiness penalties.
Comput. Oper. Res., 2008

Beam search algorithms for the single machine total weighted tardiness scheduling problem with sequence-dependent setups.
Comput. Oper. Res., 2008

Beam search heuristics for the single machine early/tardy scheduling problem with no machine idle time.
Comput. Ind. Eng., 2008

An Exact Approach for the Single Machine Scheduling Problem with Linear Early and Quadratic tardy penalties.
Asia Pac. J. Oper. Res., 2008

2007
Dispatching heuristics for the single machine early/tardy scheduling problem with job-independent penalties.
Comput. Ind. Eng., 2007

2006
Local and global dominance conditions for the weighted earliness scheduling problem with no idle time.
Comput. Ind. Eng., 2006

A Hybrid Genetic Algorithm for the Early/tardy Scheduling Problem.
Asia Pac. J. Oper. Res., 2006

2005
Improved lower bounds for the early/tardy scheduling problem with no idle time.
J. Oper. Res. Soc., 2005

An exact approach to early/tardy scheduling with release dates.
Comput. Oper. Res., 2005

Improved heuristics for the early/tardy scheduling problem with no idle time.
Comput. Oper. Res., 2005

Filtered and recovering beam search algorithms for the early/tardy scheduling problem with no idle time.
Comput. Ind. Eng., 2005


  Loading...