( en | de | ru )

 

Disambiguation of "Angelelli, Enrico"

Author of the publication

copydeleteadd this publication to your clipboard
Semi-On-line Scheduling on Two Parallel Processors with an Upper Bound on the Items.

, , and . Algorithmica, 37 (4): 243-262 (2003)

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.

Enrico Taliani

Enrico Fest

Enrico Streit

Enrico Meier

Enrico Schramm

 

Other publications of authors with the same name

Semi-On-line Scheduling on Two Parallel Processors with an Upper Bound on the Items., , and . Algorithmica, 37 (4): 243-262 (2003)A trade-off between average and maximum arc congestion minimization in traffic assignment with user constraints., , and . Comput. Oper. Res., (2019)On the complexity of interval scheduling with a resource constraint., and . Theor. Comput. Sci., 412 (29): 3650-3657 (2011)New bounds and algorithms for on-line scheduling: two identical processors, known sum and upper bound on the tasks., , and . Discret. Math. Theor. Comput. Sci., 8 (1): 1-16 (2006)The Clustered Orienteering Problem., , and . Eur. J. Oper. Res., 238 (2): 404-414 (2014)Solving the Probabilistic Profitable Tour Problem on a Tree., , and . CoRR, (2022)Competitive analysis for dynamic multiperiod uncapacitated routing problems., , and . Networks, 49 (4): 308-317 (2007)Maximum Expected Utility of Markovian Predicted Wealth., and . ICCS (2), volume 5545 of Lecture Notes in Computer Science, page 588-597. Springer, (2009)The On-Line Multiprocessor Scheduling Problem with Known Sum of the Tasks., , , and . J. Sched., 7 (6): 421-428 (2004)Complexity and approximation for Traveling Salesman Problems with profits., , , and . Theor. Comput. Sci., (2014)