Ramón Companys

According to our database1, Ramón Companys authored at least 15 papers between 2000 and 2021.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2021
An iterated greedy algorithm for the parallel blocking flow shop scheduling problem and sequence-dependent setup times.
Expert Syst. Appl., 2021

2019
An iterated greedy algorithm for solving the total tardiness parallel blocking flow shop scheduling problem.
Expert Syst. Appl., 2019

2018
A note on the paper 'Demonstrating Johnson's algorithm via resource constrained scheduling'.
Int. J. Prod. Res., 2018

2017
Efficient heuristics for the parallel blocking flow shop scheduling problem.
Expert Syst. Appl., 2017

2015
An efficient Discrete Artificial Bee Colony algorithm for the blocking flow shop problem with total flowtime minimization.
Expert Syst. Appl., 2015

Efficient heuristic algorithms for the blocking flow shop scheduling problem with total flow time minimization.
Comput. Ind. Eng., 2015

2012
Solving the Fm∣block∣C<sub>max</sub> problem using Bounded Dynamic Programming.
Eng. Appl. Artif. Intell., 2012

2011
A bounded dynamic programming algorithm for the blocking flow shop problem.
Proceedings of the 2011 IEEE Workshop On Computational Intelligence In Production And Logistics Systems, 2011

2010
Note on the behaviour of an improvement heuristic on permutation and blocking flow-shop scheduling.
Int. J. Manuf. Technol. Manag., 2010

Comparing three-step heuristics for the permutation flow shop problem.
Comput. Oper. Res., 2010

2009
Improvement Tools for NEH Based Heuristics on Permutation and Blocking Flow Shop Scheduling Problems.
Proceedings of the Advances in Production Management Systems. New Challenges, New Approaches, 2009

2007
Different behaviour of a double branch-and-bound algorithm on Fm|prmu|<i>C</i><sub>max</sub> and Fm|block|<i>C</i><sub>max</sub> problems.
Comput. Oper. Res., 2007

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

Local Search Heuristics for the Assembly Line Balancing Problem with Incompatibilities Between Tasks.
Proceedings of the 2000 IEEE International Conference on Robotics and Automation, 2000


  Loading...