( en | de | ru )

 

Disambiguation of "França, Paulo Morelato"

Author of the publication

copydeleteadd this publication to your clipboard
Evaluating genetic algorithms with different population structures on a lot sizing and scheduling problem.

, , and . SAC, page 1777-1781. ACM, (2008)

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.

Milan Paulovic

Luiz França Costa Filho

Manuel António Paulo

Hartwig Paulo

Kurt Paulokat

 

Other publications of authors with the same name

A hybrid heuristic approach to solve the multi level capacitated lot sizing problem., , and . IEEE Congress on Evolutionary Computation, page 1194-1201. IEEE, (2011)Evolutionary Approaches to Solve an Integrated Lot Scheduling Problem in the Soft Drink Industry., , , and . HIS, page 95-100. IEEE Computer Society, (2007)The open Capacitated Arc Routing Problem: Complexity and algorithms., , and . AICCSA, page 1. IEEE Computer Society, (2010)A heuristic method for lot-sizing in multi-stage systems., , , and . Comput. Oper. Res., 24 (9): 861-874 (1997)A linear optimization approach to the combined production planning model., , and . J. Frankl. Inst., 348 (7): 1523-1536 (2011)Evaluating genetic algorithms with different population structures on a lot sizing and scheduling problem., , and . SAC, page 1777-1781. ACM, (2008)A memetic algorithm for the total tardiness single machine scheduling problem., , and . Eur. J. Oper. Res., 132 (1): 224-242 (2001)The combined cutting stock and lot-sizing problem in industrial processes., and . Eur. J. Oper. Res., 174 (1): 509-521 (2006)Applying Memetic Algorithms to the Analysis of Microarray Data., , , , and . EvoWorkshops, volume 2611 of Lecture Notes in Computer Science, page 22-32. Springer, (2003)Population Studies for the Gate Matrix Layout Problem., , , and . IBERAMIA, volume 2527 of Lecture Notes in Computer Science, page 319-339. Springer, (2002)