| A genetic algorithm for the job shop problem F Della Croce, R Tadei, G Volta Computers & Operations Research 22 (1), 15-24, 1995 | 671 | 1995 |
| The two-machine total completion time flow shop problem F Della Croce, V Narayan, R Tadei European Journal of Operational Research 90 (2), 227-237, 1996 | 173 | 1996 |
| A greedy-based neighborhood search approach to a nurse rostering problem F Bellanti, G Carello, F Della Croce, R Tadei European Journal of Operational Research 153 (1), 28-40, 2004 | 168 | 2004 |
| Scheduling the Italian football league: An ILP-based approach F Della Croce, D Oliveri Computers & Operations Research 33 (7), 1963-1974, 2006 | 128 | 2006 |
| Solving the hub location problem in telecommunication network design: A local search approach G Carello, F Della Croce, M Ghirardi, R Tadei Networks: An International Journal 44 (2), 94-105, 2004 | 126 | 2004 |
| An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem A Grosso, F Della Croce, R Tadei Operations Research Letters 32 (1), 68-72, 2004 | 111 | 2004 |
| A recovering beam search algorithm for the one-machine dynamic total completion time scheduling problem F Della Croce, V T'kindt Journal of the Operational Research Society 53 (11), 1275-1280, 2002 | 109 | 2002 |
| An improved branch-and-bound algorithm for the two machine total completion time flow shop problem F Della Croce, M Ghirardi, R Tadei European Journal of Operational Research 139 (2), 293-301, 2002 | 107 | 2002 |
| Complexity of single machine scheduling problems under scenario-based uncertainty MA Aloulou, F Della Croce Operations Research Letters 36 (3), 338-342, 2008 | 100 | 2008 |
| A variable neighborhood search based matheuristic for nurse rostering problems F Della Croce, F Salassa Annals of Operations Research 218 (1), 185-199, 2014 | 94 | 2014 |
| Recovering beam search: Enhancing the beam search approach for combinatorial optimization problems FD Croce, M Ghirardi, R Tadei Journal of Heuristics 10, 89-104, 2004 | 93 | 2004 |
| Solution of the single machine total tardiness problem W Szwarc, F Della Croce, A Grosso Journal of Scheduling 2 (2), 55-71, 1999 | 89 | 1999 |
| Algorithmic paradoxes of the single‐machine total tardiness problem W Szwarc, A Grosso, FD Croce Journal of Scheduling 4 (2), 93-104, 2001 | 81 | 2001 |
| Combining swaps and node weights in an adaptive greedy approach for the maximum clique problem A Grosso, M Locatelli, FD Croce Journal of Heuristics 10, 135-152, 2004 | 67 | 2004 |
| Aggregate planning and scheduling in the food industry: A case study R Tadei, M Trubian, JL Avendano, F Della Croce, G Menga European Journal of Operational Research 87 (3), 564-573, 1995 | 66 | 1995 |
| Minimizing tardy jobs in a flowshop with common due date F Della Croce, JND Gupta, R Tadei European Journal of Operational Research 120 (2), 375-381, 2000 | 64 | 2000 |
| Generalized pairwise interchanges and machine scheduling F Della Croce European Journal of Operational Research 83 (2), 310-319, 1995 | 63 | 1995 |
| A heuristic algorithm for the auto-carrier transportation problem R Tadei, G Perboli, F Della Croce Transportation Science 36 (1), 55-62, 2002 | 60 | 2002 |
| Scheduling a round robin tennis tournamentunder courts and players availability constraints F Della Croce, R Tadei, PS Asioli Annals of Operations Research 92 (0), 349-361, 1999 | 59 | 1999 |
| A new decomposition approach for the single machine total tardiness scheduling problem F Della Croce, R Tadei, P Baracco, A Grosso Journal of the Operational Research Society 49 (10), 1101-1106, 1998 | 58 | 1998 |
