American Psychological Association 6th edition

LU LU, & POSNER, M. E. (1993). An NP-hard open shop scheduling problem with polynomial average time complexity. Mathematics of Operations Research, 18(1), 12-38.

ISO-690 (author-date, English)

LU LU und POSNER, M. E, 1993. An NP-hard open shop scheduling problem with polynomial average time complexity. Mathematics of operations research. 1 Januar 1993. Vol. 18, no. 1, p. 12-38.

Modern Language Association 9th edition

LU LU, und M. E. POSNER. „An NP-Hard Open Shop Scheduling Problem With Polynomial Average Time Complexity“. Mathematics of Operations Research, Bd. 18, Nr. 1, Januar 1993, S. 12-38.

Mohr Siebeck - Recht (Deutsch - Österreich)

LU LU/POSNER, M. E: An NP-hard open shop scheduling problem with polynomial average time complexity, Mathematics of operations research 1993, 12-38.

Emerald - Harvard

LU LU und POSNER, M.E. (1993), „An NP-hard open shop scheduling problem with polynomial average time complexity“, Mathematics of Operations Research, Vol. 18 No. 1, S. 12-38.

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