( en | de | ru )

 

Disambiguation of "Mauri, Geraldo R."

Author of the publication

copydeleteadd this publication to your clipboard
A simulated annealing metaheuristic for the bi-objective flexible job shop scheduling problem.

, , , and . RICE, page 1-6. IEEE, (2018)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Mauri Hirvenoja

Heinrich Mauri

Victor Mauri

Guiseppe Mauri

Mauri Tanner

 

Other publications of authors with the same name

A Grasp with Path-Relinking for the Workover Rig Scheduling Problem., , and . Int. J. Nat. Comput. Res., 1 (2): 1-14 (2010)A new hybrid heuristic for driver scheduling., and . Int. J. Hybrid Intell. Syst., 4 (1): 39-47 (2007)Clustering Search Heuristic for Solving a Continuous Berth Allocation Problem., , and . EvoCOP, volume 7245 of Lecture Notes in Computer Science, page 49-62. Springer, (2012)A Hybrid Column Generation Approach for the Berth Allocation Problem., , and . EvoCOP, volume 4972 of Lecture Notes in Computer Science, page 110-122. Springer, (2008)Improving a Lagrangian decomposition for the unconstrained binary quadratic programming problem., and . Comput. Oper. Res., 39 (7): 1577-1581 (2012)Customers' satisfaction in a dial-a-ride problem., and . IEEE Intell. Transp. Syst. Mag., 1 (3): 6-14 (2009)Solving the Point Feature Cartographic Label Placement problem using Jaccard index as a measure of labels intersection., , , and . CEC, page 1-8. IEEE, (2022)A lagrangean decomposition for the maximum independent set problem applied to map labeling., , and . Oper. Res., 11 (3): 229-243 (2011)A Clustering Search Metaheuristic for the Bi-objective Flexible Job Shop Scheduling Problem., , , and . CLEI, page 158-166. IEEE, (2018)A Biased Random-Key Genetic Algorithm for the Traffic Counting Location Problem., , , , and . BRACIS, page 275-280. IEEE, (2019)