AAAAAA
Results:
1-9
|
Results: 9
Authors:
WILLIAMSON DP
HALL LA
HOOGEVEEN JA
HURKENS CAJ
LENSTRA JK
SEVASTJANOV SV
SHMOYS DB
Citation: Dp. Williamson et al., SHORT SHOP SCHEDULES, Operations research, 45(2), 1997, pp. 288-294
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:
HOOGEVEEN JA
Citation: Ja. Hoogeveen, MINIMIZING MAXIMUM PROMPTNESS AND MAXIMUM LATENESS ON A SINGLE-MACHINE, Mathematics of operations research, 21(1), 1996, pp. 100-114
Authors:
HOOGEVEEN JA
Citation: Ja. Hoogeveen, SINGLE-MACHINE SCHEDULING TO MINIMIZE A FUNCTION OF 2 OR 3 MAXIMUM COST CRITERIA, Journal of algorithms, 21(2), 1996, pp. 415-433
Authors:
HOOGEVEEN JA
VANDEVELDE SL
Citation: Ja. Hoogeveen et Sl. Vandevelde, MINIMIZING TOTAL COMPLETION-TIME AND MAXIMUM COST SIMULTANEOUSLY IS SOLVABLE IN POLYNOMIAL-TIME, Operations research letters, 17(5), 1995, pp. 205-208
Authors:
HOOGEVEEN JA
VANDEVELDE SL
Citation: Ja. Hoogeveen et Sl. Vandevelde, STRONGER LAGRANGIAN BOUNDS BY USE OF SLACK VARIABLES - APPLICATIONS TO MACHINE SCHEDULING PROBLEMS, Mathematical programming, 70(2), 1995, pp. 173-190
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:
HOOGEVEEN JA
OOSTERHOUT H
VANDEVELDE SL
Citation: Ja. Hoogeveen et al., NEW LOWER AND UPPER-BOUNDS FOR SCHEDULING AROUND A SMALL COMMON DUE-DATE, Operations research, 42(1), 1994, pp. 102-110
Risultati:
1-9
|