default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJorge M. S. Valente
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j26]Carla Talens
, Jorge M. S. Valente, Victor Fernandez-Viagas:
New heuristics for the 2-stage assembly scheduling problem with total earliness and tardiness minimisation: A computational evaluation. Comput. Oper. Res. 172: 106824 (2024)- 2022
- [j25]Andréia F. Silva, Jorge M. S. Valente, Jeffrey E. Schaller:
Metaheuristics for the permutation flowshop problem with a weighted quadratic tardiness objective. Comput. Oper. Res. 140: 105691 (2022) - [j24]Jeffrey E. Schaller, Jorge M. S. Valente:
Scheduling in a no-wait flow shop to minimise total earliness and tardiness with additional idle time allowed. Int. J. Prod. Res. 60(18): 5488-5504 (2022)
2010 – 2019
- 2019
- [j23]Jeffrey E. Schaller, Jorge M. S. Valente:
Branch-and-bound algorithms for minimizing total earliness and tardiness in a two-machine permutation flow shop with unforced idle allowed. Comput. Oper. Res. 109: 1-11 (2019) - [j22]Jeffrey E. Schaller, Jorge M. S. Valente:
Heuristics for scheduling jobs in a permutation flow shop to minimize total earliness and tardiness with unforced idle time allowed. Expert Syst. Appl. 119: 376-386 (2019) - 2018
- [j21]Jeffrey E. Schaller, Jorge M. S. Valente:
Efficient heuristics for minimizing weighted sum of squared tardiness on identical parallel machines. Comput. Ind. Eng. 119: 146-156 (2018) - [j20]Victor Fernandez-Viagas, Jorge M. S. Valente, Jose M. Framiñan:
Iterated-greedy-based algorithms with beam search initialization for the permutation flowshop to minimise total tardiness. Expert Syst. Appl. 94: 58-69 (2018) - 2016
- [j19]Tomás C. Gonçalves, Jorge M. S. Valente, Jeffrey E. Schaller:
Metaheuristics for the single machine weighted quadratic tardiness scheduling problem. Comput. Oper. Res. 70: 115-126 (2016) - 2013
- [j18]Jeffrey E. Schaller, Jorge M. S. Valente:
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. 64(6): 805-816 (2013) - 2012
- [j17]Jeffrey E. Schaller, Jorge M. S. Valente:
Minimizing the weighted sum of squared tardiness on a single machine. Comput. Oper. Res. 39(5): 919-928 (2012) - [j16]Jorge M. S. Valente, Jeffrey E. Schaller:
Dispatching heuristics for the single machine weighted quadratic tardiness scheduling problem. Comput. Oper. Res. 39(9): 2223-2231 (2012) - [j15]Alok Singh, Jorge M. S. Valente, Maria do Rosário Alves Moreira:
Hybrid heuristics for the single machine scheduling problem with quadratic earliness and tardiness costs. Int. J. Mach. Learn. Cybern. 3(4): 327-333 (2012) - 2010
- [j14]Jorge M. S. Valente:
Beam search heuristics for quadratic earliness and tardiness scheduling. J. Oper. Res. Soc. 61(4): 620-631 (2010)
2000 – 2009
- 2009
- [j13]Jorge M. S. Valente:
Beam Search Heuristics for the Single Machine Scheduling Problem with Linear earliness and Quadratic tardiness Costs. Asia Pac. J. Oper. Res. 26(3): 319-339 (2009) - [j12]Jorge M. S. Valente, José Fernando Gonçalves:
A genetic algorithm approach for the single machine scheduling problem with linear earliness and quadratic tardiness penalties. Comput. Oper. Res. 36(10): 2707-2715 (2009) - [c1]Pedro H. Abreu, Carlos Soares, Jorge M. S. Valente:
Selection of Heuristics for the Job-Shop Scheduling Problem Based on the Prediction of Gaps in Machines. LION 2009: 134-147 - 2008
- [j11]Jorge M. S. Valente:
An Exact Approach for the Single Machine Scheduling Problem with Linear Early and Quadratic tardy penalties. Asia Pac. J. Oper. Res. 25(2): 169-186 (2008) - [j10]Jorge M. S. Valente:
Beam search heuristics for the single machine early/tardy scheduling problem with no machine idle time. Comput. Ind. Eng. 55(3): 663-675 (2008) - [j9]Jorge M. S. Valente, Rui A. F. S. Alves:
Beam search algorithms for the single machine total weighted tardiness scheduling problem with sequence-dependent setups. Comput. Oper. Res. 35(7): 2388-2405 (2008) - [j8]Jorge M. S. Valente, Rui A. F. S. Alves:
Heuristics for the single machine scheduling problem with quadratic earliness and tardiness penalties. Comput. Oper. Res. 35(11): 3696-3713 (2008) - 2007
- [j7]Jorge M. S. Valente:
Dispatching heuristics for the single machine early/tardy scheduling problem with job-independent penalties. Comput. Ind. Eng. 52(4): 434-447 (2007) - 2006
- [j6]Jorge M. S. Valente, José Fernando Gonçalves, Rui A. F. S. Alves:
A Hybrid Genetic Algorithm for the Early/tardy Scheduling Problem. Asia Pac. J. Oper. Res. 23(3): 393-405 (2006) - [j5]Jorge M. S. Valente:
Local and global dominance conditions for the weighted earliness scheduling problem with no idle time. Comput. Ind. Eng. 51(4): 765-780 (2006) - 2005
- [j4]Jorge M. S. Valente, Rui A. F. S. Alves:
Filtered and recovering beam search algorithms for the early/tardy scheduling problem with no idle time. Comput. Ind. Eng. 48(2): 363-375 (2005) - [j3]Jorge M. S. Valente, Rui A. F. S. Alves:
Improved heuristics for the early/tardy scheduling problem with no idle time. Comput. Oper. Res. 32: 557-569 (2005) - [j2]Jorge M. S. Valente, Rui A. F. S. Alves:
An exact approach to early/tardy scheduling with release dates. Comput. Oper. Res. 32: 2905-2917 (2005) - [j1]Jorge M. S. Valente, Rui A. F. S. Alves:
Improved lower bounds for the early/tardy scheduling problem with no idle time. J. Oper. Res. Soc. 56(5): 604-612 (2005)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:14 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
