Makespan Minimization of task graphs with random task running times. - Lucian Finta; Zhen Liu 001 (Interconnection Networks and Mapping and Scheduling Parallel Computations, 1994)

Single Machine Scheduling Subject To Precedence Delays. - Lucian Finta; Zhen Liu 001 (Discret. Appl. Math., 1996)

Scheduling UET-UCT Series-Parallel Graphs on Two Processors. - Lucian Finta; Zhen Liu 001; Ioannis Milis; Evripidis Bampis (Theor. Comput. Sci., 1996)

Complexity of Task Graph Scheduling with Fixed Communication Capacity. - Lucian Finta; Zhen Liu 001 (Int. J. Found. Comput. Sci., 1997)

A linear time algorithm for scheduling outforests with communication delays on three processors. - Mauro Dell'Amico; Lucian Finta (J. Algorithms, 2002)

Scheduling trees with large communication delays on two identical processors. - Foto N. Afrati; Evripidis Bampis; Lucian Finta; Ioannis Milis (J. Sched., 2005)

Real-Time Distributed Scheduling of Precedence Graphs on Arbitrary Wide Networks. - Franck Butelle; Mourad Hakem; Lucian Finta (IPDPS, 2007)

Scheduling an interval ordered precedence graph with communication delays and a limited number of processors. - Alix Munier Kordon; Fadi Kacem; Benoît Dupont de Dinechin; Lucian Finta (RAIRO Oper. Res., 2013)

Fast machine reassignment. - Franck Butelle; Laurent Alfandari; Camille Coti; Lucian Finta; Lucas Létocart; Gérard Plateau; Frédéric Roupin; Antoine Rozenknop; Roberto Wolfler Calvo (Ann. Oper. Res., 2016)