( en | de | ru )

 

Disambiguation of "Beraldi, Patrizia"

Author of the publication

copydeleteadd this publication to your clipboard
Rolling-horizon and fix-and-relax heuristics for the parallel machine lot-sizing and scheduling problem with sequence-dependent set-up costs.

, , , and . Comput. Oper. Res., 35 (11): 3644-3656 (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.

Anna Beraldi

Patrizia Hey

Patrizia Cantoni

Patrizia Benedetti

Patrizia Nitsch

 

Other publications of authors with the same name

Constrained auction clearing in the Italian electricity market., , , and . 4OR, 2 (1): 35-51 (2004)Grid Computing for Financial Applications., , , and . High Performance Computing Workshop, volume 18 of Advances in Parallel Computing, page 380-395. IOS Press, (2008)The Probabilistic Set-Covering Problem., and . Operations Research, 50 (6): 956-967 (2002)Capital rationing problems under uncertainty and risk., , and . Comput. Optim. Appl., 51 (3): 1375-1396 (2012)Dealing with the stochastic prosumager problem with controllable loads., , and . Soft Comput., 27 (18): 12913-12924 (2023)A Two-stage Stochastic Programming Model for the Resource Constrained Project Scheduling Problem under Uncertainty., , , and . ICORES, page 194-200. SciTePress, (2018)Rolling-horizon and fix-and-relax heuristics for the parallel machine lot-sizing and scheduling problem with sequence-dependent set-up costs., , , and . Comput. Oper. Res., 35 (11): 3644-3656 (2008)Special issue on: Optimization methods for decision making: advances and applications., , and . Soft Comput., 23 (9): 2849-2852 (2019)A heuristic approach for resource constrained project scheduling with uncertain activity durations., , , and . Comput. Oper. Res., 38 (9): 1305-1318 (2011)A computational study of exact approaches for the adjustable robust resource-constrained project scheduling problem., , , and . Comput. Oper. Res., (2018)