Citation: P. Dellolmo et al., A 13 12 APPROXIMATION ALGORITHM FOR BIN PACKING WITH EXTENDIBLE BINS/, Information processing letters, 65(5), 1998, pp. 229-233
Authors:
BIANCO L
BLAZEWICZ J
DELLOLMO P
DROZDOWSKI M
Citation: L. Bianco et al., LINEAR ALGORITHMS FOR PREEMPTIVE SCHEDULING OF MULTIPROCESSOR TASKS SUBJECT TO MINIMAL LATENESS, Discrete applied mathematics, 72(1-2), 1997, pp. 25-46
Citation: P. Dellolmo et al., COMPARABILITY GRAPH AUGMENTATION FOR SOME MULTIPROCESSOR SCHEDULING PROBLEMS, Discrete applied mathematics, 72(1-2), 1997, pp. 71-84
Citation: L. Bianco et al., AN OPTIMAL ALGORITHM TO FIND THE JUMP NUMBER OF PARTIALLY ORDERED SETS, COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 8(2), 1997, pp. 197-210
Citation: P. Dellolmo et al., AN APPROXIMATION RESULT FOR A DUO-PROCESSOR TASK-SCHEDULING PROBLEM, Information processing letters, 61(4), 1997, pp. 195-200
Citation: L. Bianco et al., NONPREEMPTIVE SCHEDULING OF INDEPENDENT TASKS WITH PRESPECIFIED PROCESSOR ALLOCATIONS, Naval research logistics, 41(7), 1994, pp. 959-971
Authors:
BIANCO L
BLAZEWICZ J
DELLOLMO P
DROZDOWSKI M
Citation: L. Bianco et al., PREEMPTIVE SCHEDULING OF MULTIPROCESSOR TASKS ON THE DEDICATED PROCESSOR SYSTEM SUBJECT TO MINIMAL LATENESS, Information processing letters, 46(3), 1993, pp. 109-113