Name
Playground
About
FAQ
GitHub
Playground
Shortest Path Finder
Community Detector
Connected Papers
Author Trending
Antonia Azzini
Tidjani Négadi
Claudia Calabrese
Gopal Ananthakrishnan
Jhonathan Pinzon
Giovanni Venturelli
Chen Ma
Dusanka Janezic
Radu Timofte
Kuanrui Yin
Home
/
Author
/
RAMÓN COMPANYS
Author Info
Open Visualization
Name
Affiliation
Papers
RAMÓN COMPANYS
Corresponding author. Tel.: +343 401 6626; fax: 343 401 6054; e-mail: companys@oe.upc.es
5
Collaborators
Citations
PageRank
6
12
2.02
Referers
Referees
References
20
58
30
Publications (5 rows)
Collaborators (6 rows)
Referers (20 rows)
Referees (58 rows)
Title
Citations
PageRank
Year
An iterated greedy algorithm for solving the total tardiness parallel blocking flow shop scheduling problem.
6
0.41
2019
Solving the Fm∣block∣Cmax problem using Bounded Dynamic Programming.
2
0.39
2012
Note on the behaviour of an improvement heuristic on permutation and blocking flow-shop scheduling
2
0.45
2010
Improvement Tools for NEH Based Heuristics on Permutation and Blocking Flow Shop Scheduling Problems
2
0.44
2009
Note on cyclic sequences in the product rate variation problem
0
0.34
2000
1