default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFrancisco Ballestín
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2020
[j16]Francisco Ballestín, Ángeles Pérez
, M. Sacramento Quintanilla:
A multistage heuristic for storage and retrieval problems in a warehouse with random storage. Int. Trans. Oper. Res. 27(3): 1699-1728 (2020)- [j15]M. Sacramento Quintanilla, Francisco Ballestín, Ángeles Pérez:
Mathematical models to improve the current practice in a Home Healthcare Unit. OR Spectr. 42(1): 43-74 (2020) - 2019
- [j14]Francisco Ballestín, Ángeles Pérez, M. Sacramento Quintanilla:
Scheduling and rescheduling elective patients in operating rooms to minimise the percentage of tardy patients. J. Sched. 22(1): 107-118 (2019) - 2013
- [j13]Francisco Ballestín, M. Angeles Pérez Alarcó, M. Pilar Lino Sorlí, M. Sacramento Quintanilla, Vicente Valls:
Static and dynamic policies with RFID for the scheduling of retrieval and storage warehouse operations. Comput. Ind. Eng. 66(4): 696-709 (2013) - 2011
- [j12]Agustín Barrios, Francisco Ballestín, Vicente Valls:
A double genetic algorithm for the MRCPSP/max. Comput. Oper. Res. 38(1): 33-43 (2011) - [j11]Francisco Ballestín, Rosa Blanco:
Theoretical and practical fundamentals for multi-objective optimisation in resource-constrained project scheduling problems. Comput. Oper. Res. 38(1): 51-62 (2011) - [j10]Francisco Ballestín, Agustín Barrios, Vicente Valls:
An evolutionary algorithm for the resource-constrained project scheduling problem with minimum and maximum time lags. J. Sched. 14(4): 391-406 (2011) - 2009
- [j9]Francisco Ballestín, Vicente Valls, M. Sacramento Quintanilla:
Scheduling projects with limited number of preemptions. Comput. Oper. Res. 36(11): 2913-2925 (2009) - 2008
- [j8]Francisco Ballestín, Roel Leus:
Meta-heuristics for stable scheduling on a single machine. Comput. Oper. Res. 35(7): 2175-2192 (2008) - [j7]Vicente Valls, Francisco Ballestín, M. Sacramento Quintanilla:
A hybrid genetic algorithm for the resource-constrained project scheduling problem. Eur. J. Oper. Res. 185(2): 495-508 (2008) - [j6]Francisco Ballestín, Vicente Valls, M. Sacramento Quintanilla:
Pre-emption in resource-constrained project scheduling. Eur. J. Oper. Res. 189(3): 1136-1152 (2008) - 2007
- [j5]Stijn Van de Vonder, Francisco Ballestín, Erik Demeulemeester, Willy Herroelen:
Heuristic procedures for reactive project scheduling. Comput. Ind. Eng. 52(1): 11-28 (2007) - [j4]Francisco Ballestín:
When it is worthwhile to work with the stochastic RCPSP? J. Sched. 10(3): 153-166 (2007) - 2005
- [j3]Vicente Valls, Francisco Ballestín, M. Sacramento Quintanilla:
Justification and RCPSP: A technique that pays. Eur. J. Oper. Res. 165(2): 375-386 (2005) - 2004
- [j2]Vicente Valls, Francisco Ballestín, M. Sacramento Quintanilla:
A Population-Based Approach to the Resource-Constrained Project Scheduling Problem. Ann. Oper. Res. 131(1-4): 305-324 (2004) - 2003
- [j1]Vicente Valls, M. Sacramento Quintanilla, Francisco Ballestín:
Resource-constrained project scheduling: A critical activity reordering heuristic. Eur. J. Oper. Res. 149(2): 282-301 (2003)
Conference and Workshop Papers
- 2009
- [c2]Francisco Ballestín, M. Pilar Lino Sorlí, M. Angeles Pérez Alarcó, M. Sacramento Quintanilla, Vicente Valls:
Using RFID information in routing and sequencing warehouse operations. Intelligent Environments (Workshops) 2009: 77-83 - 2007
- [c1]Francisco Ballestín:
A Genetic Algorithm for the Resource Renting Problem with Minimum and Maximum Time Lags. EvoCOP 2007: 25-35
Parts in Books or Collections
- 2008
- [p1]Francisco Ballestín:
Different Codifications and Metaheuristic Algorithms for the Resource Renting Problem with Minimum and Maximum Time Lags. Recent Advances in Evolutionary Computation for Combinatorial Optimization 2008: 187-202
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 2024-04-24 23:19 CEST 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:
