default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRamón Companys
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j12]Imma Ribas
, Ramón Companys, Xavier Tort-Martorell:
An iterated greedy algorithm for the parallel blocking flow shop scheduling problem and sequence-dependent setup times. Expert Syst. Appl. 184: 115535 (2021)
2010 – 2019
- 2019
- [j11]Imma Ribas, Ramón Companys, Xavier Tort-Martorell:
An iterated greedy algorithm for solving the total tardiness parallel blocking flow shop scheduling problem. Expert Syst. Appl. 121: 347-361 (2019) - 2018
- [j10]Ramón Companys, Imma Ribas:
A note on the paper 'Demonstrating Johnson's algorithm via resource constrained scheduling'. Int. J. Prod. Res. 56(9): 3097-3098 (2018) - 2017
- [j9]Imma Ribas, Ramón Companys, Xavier Tort-Martorell:
Efficient heuristics for the parallel blocking flow shop scheduling problem. Expert Syst. Appl. 74: 41-54 (2017) - 2015
- [j8]Imma Ribas, Ramón Companys:
Efficient heuristic algorithms for the blocking flow shop scheduling problem with total flow time minimization. Comput. Ind. Eng. 87: 30-39 (2015) - [j7]Imma Ribas, Ramón Companys, Xavier Tort-Martorell:
An efficient Discrete Artificial Bee Colony algorithm for the blocking flow shop problem with total flowtime minimization. Expert Syst. Appl. 42(15-16): 6155-6167 (2015) - 2012
- [j6]Joaquín Bautista, Alberto Cano, Ramón Companys, Imma Ribas:
Solving the Fm∣block∣Cmax problem using Bounded Dynamic Programming. Eng. Appl. Artif. Intell. 25(6): 1235-1245 (2012) - 2011
- [c3]Joaquín Bautista, Alberto Cano, Ramón Companys, Imma Ribas:
A bounded dynamic programming algorithm for the blocking flow shop problem. CIPLS 2011: 8-15 - 2010
- [j5]Imma Ribas, Ramón Companys, Xavier Tort-Martorell:
Comparing three-step heuristics for the permutation flow shop problem. Comput. Oper. Res. 37(12): 2062-2070 (2010) - [j4]Ramón Companys, Imma Ribas, Manuel Mateo:
Note on the behaviour of an improvement heuristic on permutation and blocking flow-shop scheduling. Int. J. Manuf. Technol. Manag. 20(1/2/3/4): 331-357 (2010)
2000 – 2009
- 2009
- [c2]Ramón Companys, Imma Ribas, Manuel Mateo:
Improvement Tools for NEH Based Heuristics on Permutation and Blocking Flow Shop Scheduling Problems. APMS 2009: 33-40 - 2007
- [j3]Ramón Companys, Manuel Mateo:
Different behaviour of a double branch-and-bound algorithm on Fm|prmu|Cmax and Fm|block|Cmax problems. Comput. Oper. Res. 34(4): 938-953 (2007) - 2001
- [j2]Joaquín Bautista, Ramón Companys, Albert Corominas:
Solving the generalized apportionment problem through the optimization of discrepancy functions. Eur. J. Oper. Res. 131(3): 676-684 (2001) - 2000
- [j1]Joaquín Bautista, Ramón Companys, Albert Corominas:
Note on cyclic sequences in the product rate variation problem. Eur. J. Oper. Res. 124(3): 468-477 (2000) - [c1]Joaquín Bautista, Raúl Suárez, Manuel Mateo, Ramón Companys:
Local Search Heuristics for the Assembly Line Balancing Problem with Incompatibilities Between Tasks. ICRA 2000: 2404-2409
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-25 05:45 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:
