( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Solving the Fm∣block∣Cmax problem using Bounded Dynamic Programming.

, , , и . Eng. Appl. Artif. Intell., 25 (6): 1235-1245 (2012)

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.

Laura Ramón Giménez

Ramón Nolasco

Ramón Kucharzak

Ramón Briegel

Ramón Arzápalo

 

Другие публикации лиц с тем же именем

An efficient Discrete Artificial Bee Colony algorithm for the blocking flow shop problem with total flowtime minimization., , и . Expert Syst. Appl., 42 (15-16): 6155-6167 (2015)Solving the Fm∣block∣Cmax problem using Bounded Dynamic Programming., , , и . Eng. Appl. Artif. Intell., 25 (6): 1235-1245 (2012)Note on the behaviour of an improvement heuristic on permutation and blocking flow-shop scheduling., , и . Int. J. Manuf. Technol. Manag., 20 (1/2/3/4): 331-357 (2010)Local Search Heuristics for the Assembly Line Balancing Problem with Incompatibilities Between Tasks., , , и . ICRA, стр. 2404-2409. IEEE, (2000)Efficient heuristics for the parallel blocking flow shop scheduling problem., , и . Expert Syst. Appl., (2017)An iterated greedy algorithm for the parallel blocking flow shop scheduling problem and sequence-dependent setup times., , и . Expert Syst. Appl., (2021)Solving the generalized apportionment problem through the optimization of discrepancy functions., , и . Eur. J. Oper. Res., 131 (3): 676-684 (2001)Improvement Tools for NEH Based Heuristics on Permutation and Blocking Flow Shop Scheduling Problems., , и . APMS, том 338 из IFIP Advances in Information and Communication Technology, стр. 33-40. Springer, (2009)A bounded dynamic programming algorithm for the blocking flow shop problem., , , и . CIPLS, стр. 8-15. IEEE, (2011)Efficient heuristic algorithms for the blocking flow shop scheduling problem with total flow time minimization., и . Comput. Ind. Eng., (2015)