American Psychological Association 6th edition

DELLA CROCE DI DOJOLA, F., GHIRARDI, M., & TADEI, R. (2002). An improved branch-and-bound algorithm for the two machine total completion time flow shop problem. European Journal of Operational Research, 139, 293-301. https://doi.org/10.1016/s0377-2217(01)00374-5

ISO-690 (author-date, English)

DELLA CROCE DI DOJOLA, Federico, GHIRARDI, MARCO und TADEI, Roberto, 2002. An improved branch-and-bound algorithm for the two machine total completion time flow shop problem. European Journal of Operational Research. 1 Juni 2002. Vol. 139, , p. 293-301. DOI 10.1016/s0377-2217(01)00374-5.

Modern Language Association 9th edition

DELLA CROCE DI DOJOLA, F., M. GHIRARDI, und R. TADEI. „An Improved Branch-and-Bound Algorithm for the Two Machine Total Completion Time Flow Shop Problem“. European Journal of Operational Research, Bd. 139, Juni 2002, S. 293-01, https://doi.org/10.1016/s0377-2217(01)00374-5.

Mohr Siebeck - Recht (Deutsch - Österreich)

DELLA CROCE DI DOJOLA, Federico/GHIRARDI, MARCO/TADEI, Roberto: An improved branch-and-bound algorithm for the two machine total completion time flow shop problem, European Journal of Operational Research 2002, 293-301.

Emerald - Harvard

DELLA CROCE DI DOJOLA, F., GHIRARDI, M. und TADEI, R. (2002), „An improved branch-and-bound algorithm for the two machine total completion time flow shop problem“, European Journal of Operational Research, Vol. 139, S. 293-301.

Achtung: Diese Zitate sind unter Umständen nicht zu 100% korrekt.