default search action
Albert Corominas
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j35]Albert Corominas:
A model for designing a procurement-inventory system as a defence against a recurring epidemic. Int. J. Prod. Res. 60(11): 3305-3318 (2022)
2010 – 2019
- 2019
- [j34]Imma Ribas
, Amaia Lusa, Albert Corominas:
A framework for designing a supply chain distribution network. Int. J. Prod. Res. 57(7): 2104-2116 (2019) - [j33]Albert Corominas, Alberto García-Villoria, Néstor-Andrés González, Rafael Pastor
A multistage graph-based procedure for solving a just-in-time flexible job-shop scheduling problem with machine and time-dependent processing costs. J. Oper. Res. Soc. 70(4): 620-633 (2019) - 2018
- [j32]Alberto García-Villoria, Albert Corominas, Adrià Nadal
Solving the accessibility windows assembly line problem level 1 and variant 1 (AWALBP-L1-1) with precedence constraints. Eur. J. Oper. Res. 271(3): 882-895 (2018) - [j31]Gema Calleja, Albert Corominas, Carme Martínez Costa, Rocio de la Torre:
Methodological approaches to supply chain design. Int. J. Prod. Res. 56(13): 4467-4489 (2018) - [j30]Ernest Benedito, Albert Corominas:
Embodying decisions on work shifts into strategic manufacturing capacity planning. Int. J. Prod. Res. 56(18): 6135-6146 (2018) - 2016
- [j29]Gema Calleja, Albert Corominas, Alberto García-Villoria, Rafael Pastor
Hybrid metaheuristics for the Accessibility Windows Assembly Line Balancing Problem Level 2 (AWALBP-L2). Eur. J. Oper. Res. 250(3): 760-772 (2016) - [j28]Ernest Benedito, Albert Corominas, Carme Martínez Costa, Marta Mas Machuca:
Single-site strategic capacity planning considering renewal, maintenance, inventory, taxes and cash flow management. J. Oper. Res. Soc. 67(7): 970-981 (2016) - 2015
- [j27]Albert Corominas, Alberto García-Villoria, Rafael Pastor
Technical Note: Relating to the Parameter Values Given by Nelder and Mead in their Algorithm. Comput. J. 58(1): 157-159 (2015) - [j26]Alberto García-Villoria, Albert Corominas, Rafael Pastor
Heuristics and simulated annealing procedures for the accessibility windows assembly line problem level 1 (AWALBP-L1). Comput. Oper. Res. 62: 1-11 (2015) - 2014
- [j25]Gema Calleja, Albert Corominas, Alberto García-Villoria, Rafael Pastor
Combining matheuristics and MILP to solve the accessibility windows assembly line balancing problem level 2 (AWALBP-L2). Comput. Oper. Res. 48: 113-123 (2014) - 2013
- [j24]Albert Corominas, Alberto García-Villoria, Rafael Pastor
Technical note: a systematic procedure based on CALIBRA and the Nelder & Mead algorithm for fine-tuning metaheuristics. J. Oper. Res. Soc. 64(2): 276-282 (2013) - [j23]Alberto García-Villoria, Albert Corominas, Xavier Delorme
A branch and bound algorithm for the response time variability problem. J. Sched. 16(2): 243-252 (2013) - 2012
- [j22]Albert Corominas, Amaia Lusa
A detailed workforce planning model including non-linear dependence of capacity on the size of the staff and cash management. Eur. J. Oper. Res. 216(2): 445-458 (2012) - 2011
- [j21]Alberto García-Villoria, Saïd Salhi
Hyper-heuristic approaches for the response time variability problem. Eur. J. Oper. Res. 211(1): 160-169 (2011) - [j20]Albert Corominas, Rafael Pastor
Designing greedy algorithms for the flow-shop problem by means of Empirically Adjusted Greedy Heuristics (EAGH). J. Oper. Res. Soc. 62(9): 1704-1710 (2011) - 2010
- [j19]Jordi Olivella, Albert Corominas, Rafael Pastor
An entropy-based measurement of working time flexibility. Eur. J. Oper. Res. 200(1): 253-260 (2010) - [j18]Albert Corominas, Wieslaw Kubiak, Rafael Pastor
Mathematical programming modeling of the Response Time Variability Problem. Eur. J. Oper. Res. 200(2): 347-357 (2010) - [j17]Alberto García-Villoria, Albert Corominas, Rafael Pastor
Solving the response time variability problem by means of the cross-entropy method. Int. J. Manuf. Technol. Manag. 20(1/2/3/4): 316-330 (2010) - [j16]Albert Corominas, Jordi Olivella, Rafael Pastor
Capacity planning with working time accounts in services. J. Oper. Res. Soc. 61(2): 321-331 (2010) - [j15]Albert Corominas, Alberto García-Villoria, Rafael Pastor
Fine-tuning a parametric Clarke and Wright heuristic by means of EAGH (empirically adjusted greedy heuristics). J. Oper. Res. Soc. 61(8): 1309-1314 (2010)
2000 – 2009
- 2009
- [j14]Albert Corominas, Rafael Pastor
Scheduling production of multiple part-types in a system with pre-known demands and deterministic inactive time intervals. Eur. J. Oper. Res. 193(2): 639-643 (2009) - [c3]Albert Corominas, Alberto García-Villoria, Rafael Pastor
A Parametric Multi-start Algorithm for Solving the Response Time Variability Problem. LSSC 2009: 302-309 - 2008
- [j13]Sergio Rubio
Optimal manufacturing-remanufacturing policies in a lean production environment. Comput. Ind. Eng. 55(1): 234-242 (2008) - [c2]Albert Corominas, Alberto García-Villoria, Rafael Pastor
Solving the Response Time Variability Problem by means of Multi-start and GRASP metaheuristics. CCIA 2008: 128-137 - 2007
- [j12]Albert Corominas, Amaia Lusa
Planning production and working time within an annualised hours scheme framework. Ann. Oper. Res. 155(1): 5-23 (2007) - [j11]Albert Corominas, Amaia Lusa
Planning annualised hours with a finite set of weekly working hours and cross-trained workers. Eur. J. Oper. Res. 176(1): 230-239 (2007) - [j10]Albert Corominas, Amaia Lusa
Using a MILP model to establish a framework for an annualised hours agreement. Eur. J. Oper. Res. 177(3): 1495-1506 (2007) - [j9]Albert Corominas, Wieslaw Kubiak, Natalia Moreno Palli:
Response time variability. J. Sched. 10(2): 97-110 (2007) - 2006
- [j8]Natalia Moreno Palli, Albert Corominas:
Solving the minmax product rate variation problem (PRVP) as a bottleneck assignment problem. Comput. Oper. Res. 33: 928-939 (2006) - [c1]Alberto García-Villoria, Rafael Pastor, Albert Corominas:
Solving the Response Time Variability Problem by means of metaheuristics. CCIA 2006: 187-194 - 2005
- [j7]Albert Corominas, Jordi Ojeda
Multi-objective allocation of multi-function workers with lower bounded capacity. J. Oper. Res. Soc. 56(6): 738-743 (2005) - 2004
- [j6]Albert Corominas, Amaia Lusa, Rafael Pastor
Planning Annualised Hours with a Finite Set of Weekly Working Hours and Joint Holidays. Ann. Oper. Res. 128(1-4): 217-233 (2004) - [j5]Albert Corominas, Amaia Lusa
Characteristics and classification of the annualised working hours planning problems. Int. J. Serv. Technol. Manag. 5(5/6): 435-447 (2004) - 2002
- [j4]Albert Corominas, Amaia Lusa
Using MILP to plan annualised working hours. J. Oper. Res. Soc. 53(10): 1101-1108 (2002) - [j3]Albert Corominas:
A remark about "A comment on consecutive-2-out-of-n systems". Oper. Res. Lett. 30(1): 69-70 (2002) - 2001
- [j2]Joaquín Bautista
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
Note on cyclic sequences in the product rate variation problem. Eur. J. Oper. Res. 124(3): 468-477 (2000)
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:06 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: