Albert Corominas

According to our database1, Albert Corominas authored at least 38 papers between 2000 and 2022.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
A model for designing a procurement-inventory system as a defence against a recurring epidemic.
Int. J. Prod. Res., 2022

2019
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., 2019

A framework for designing a supply chain distribution network.
Int. J. Prod. Res., 2019

2018
Methodological approaches to supply chain design.
Int. J. Prod. Res., 2018

Embodying decisions on work shifts into strategic manufacturing capacity planning.
Int. J. Prod. Res., 2018

Solving the accessibility windows assembly line problem level 1 and variant 1 (AWALBP-L1-1) with precedence constraints.
Eur. J. Oper. Res., 2018

2016
Single-site strategic capacity planning considering renewal, maintenance, inventory, taxes and cash flow management.
J. Oper. Res. Soc., 2016

Hybrid metaheuristics for the Accessibility Windows Assembly Line Balancing Problem Level 2 (AWALBP-L2).
Eur. J. Oper. Res., 2016

2015
Heuristics and simulated annealing procedures for the accessibility windows assembly line problem level 1 (AWALBP-L1).
Comput. Oper. Res., 2015

Technical Note: Relating to the Parameter Values Given by Nelder and Mead in their Algorithm.
Comput. J., 2015

2014
Combining matheuristics and MILP to solve the accessibility windows assembly line balancing problem level 2 (AWALBP-L2).
Comput. Oper. Res., 2014

2013
A branch and bound algorithm for the response time variability problem.
J. Sched., 2013

Technical note: a systematic procedure based on CALIBRA and the Nelder & Mead algorithm for fine-tuning metaheuristics.
J. Oper. Res. Soc., 2013

2012
A detailed workforce planning model including non-linear dependence of capacity on the size of the staff and cash management.
Eur. J. Oper. Res., 2012

2011
Designing greedy algorithms for the flow-shop problem by means of Empirically Adjusted Greedy Heuristics (EAGH).
J. Oper. Res. Soc., 2011

Hyper-heuristic approaches for the response time variability problem.
Eur. J. Oper. Res., 2011

2010
Capacity planning with working time accounts in services.
J. Oper. Res. Soc., 2010

Fine-tuning a parametric Clarke and Wright heuristic by means of EAGH (empirically adjusted greedy heuristics).
J. Oper. Res. Soc., 2010

Solving the response time variability problem by means of the cross-entropy method.
Int. J. Manuf. Technol. Manag., 2010

An entropy-based measurement of working time flexibility.
Eur. J. Oper. Res., 2010

Mathematical programming modeling of the Response Time Variability Problem.
Eur. J. Oper. Res., 2010

2009
Scheduling production of multiple part-types in a system with pre-known demands and deterministic inactive time intervals.
Eur. J. Oper. Res., 2009

A Parametric Multi-start Algorithm for Solving the Response Time Variability Problem.
Proceedings of the Large-Scale Scientific Computing, 7th International Conference, 2009

2008
Optimal manufacturing-remanufacturing policies in a lean production environment.
Comput. Ind. Eng., 2008

Solving the Response Time Variability Problem by means of Multi-start and GRASP metaheuristics.
Proceedings of the Artificial Intelligence Research and Development, 2008

2007
Response time variability.
J. Sched., 2007

Using a MILP model to establish a framework for an annualised hours agreement.
Eur. J. Oper. Res., 2007

Planning annualised hours with a finite set of weekly working hours and cross-trained workers.
Eur. J. Oper. Res., 2007

Planning production and working time within an annualised hours scheme framework.
Ann. Oper. Res., 2007

2006
Solving the minmax product rate variation problem (PRVP) as a bottleneck assignment problem.
Comput. Oper. Res., 2006

Solving the Response Time Variability Problem by means of metaheuristics.
Proceedings of the Artificial Intelligence Research and Development, 2006

2005
Multi-objective allocation of multi-function workers with lower bounded capacity.
J. Oper. Res. Soc., 2005

2004
Characteristics and classification of the annualised working hours planning problems.
Int. J. Serv. Technol. Manag., 2004

Planning Annualised Hours with a Finite Set of Weekly Working Hours and Joint Holidays.
Ann. Oper. Res., 2004

2002
A remark about "A comment on consecutive-2-out-of-<i>n</i> systems".
Oper. Res. Lett., 2002

Using MILP to plan annualised working hours.
J. Oper. Res. Soc., 2002

2001
Solving the generalized apportionment problem through the optimization of discrepancy functions.
Eur. J. Oper. Res., 2001

2000
Note on cyclic sequences in the product rate variation problem.
Eur. J. Oper. Res., 2000


  Loading...