Authors: HOOGEVEEN JA LENSTRA JK VELTMAN B

Citation: Ja. Hoogeveen et al., PREEMPTIVE SCHEDULING IN A 2-STAGE MULTIPROCESSOR FLOW-SHOP IS NP-HARD, European journal of operational research, 89(1), 1996, pp. 172-175

Authors: LENSTRA JK VELDHORST M VELTMAN B

Citation: Jk. Lenstra et al., THE COMPLEXITY OF SCHEDULING TREES WITH COMMUNICATION DELAYS, Journal of algorithms, 20(1), 1996, pp. 157-173

Authors: HOOGEVEEN JA VANDEVELDE SL VELTMAN B

Citation: Ja. Hoogeveen et al., COMPLEXITY OF SCHEDULING MULTIPROCESSOR TASKS WITH PRESPECIFIED PROCESSOR ALLOCATIONS, Discrete applied mathematics, 55(3), 1994, pp. 259-272

Authors: HOOGEVEEN JA LENSTRA JK VELTMAN B

Citation: Ja. Hoogeveen et al., 3, 4, 5, 6, OR THE COMPLEXITY OF SCHEDULING WITH COMMUNICATION DELAYS, Operations research letters, 16(3), 1994, pp. 129-137

Authors: CURIEL I POTTERS J PRASAD R TIJS S VELTMAN B

Citation: I. Curiel et al., SEQUENCING AND COOPERATION, Operations research, 42(3), 1994, pp. 566-568