Jorge M. S. Valente

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Metaheuristics for the permutation flowshop problem with a weighted quadratic tardiness objective Computers & Operations Research	2022-03-09	Paper
Branch-and-bound algorithms for minimizing total earliness and tardiness in a two-machine permutation flow shop with unforced idle allowed Computers & Operations Research	2019-07-09	Paper
Metaheuristics for the single machine weighted quadratic tardiness scheduling problem Computers & Operations Research	2018-07-12	Paper
Dispatching heuristics for the single machine weighted quadratic tardiness scheduling problem Computers & Operations Research	2012-11-15	Paper
Minimizing the weighted sum of squared tardiness on a single machine Computers & Operations Research	2012-11-15	Paper
BEAM SEARCH HEURISTICS FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH LINEAR EARLINESS AND QUADRATIC TARDINESS COSTS Asia-Pacific Journal of Operational Research	2009-08-14	Paper
A genetic algorithm approach for the single machine scheduling problem with linear earliness and quadratic tardiness penalties Computers & Operations Research	2009-05-19	Paper
AN EXACT APPROACH FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH LINEAR EARLY AND QUADRATIC TARDY PENALTIES Asia-Pacific Journal of Operational Research	2008-08-26	Paper
Heuristics for the single machine scheduling problem with quadratic earliness and tardiness penalties Computers & Operations Research	2008-04-28	Paper
Beam search algorithms for the single machine total weighted tardiness scheduling problem with sequence-dependent setups Computers & Operations Research	2008-01-23	Paper
scientific article; zbMATH DE number 5151903 (Why is no real title available?)	2007-05-11	Paper
A HYBRID GENETIC ALGORITHM FOR THE EARLY/TARDY SCHEDULING PROBLEM Asia-Pacific Journal of Operational Research	2006-09-12	Paper
Improved lower bounds for the early/tardy scheduling problem with no idle time The Journal of the Operational Research Society	2005-08-17	Paper
An exact approach to early/tardy scheduling with release dates Computers & Operations Research	2005-06-27	Paper
Improved heuristics for the early/tardy scheduling problem with no idle time Computers & Operations Research	2004-11-19	Paper

Research outcomes over time

This page was built for person: Jorge M. S. Valente