AAAAAA
Results:
1-8
|
Results: 8
Authors:
PHILLIPS CA
SCHULZ AS
SHMOYS DB
STEIN C
WEIN J
Citation: Ca. Phillips et al., IMPROVED BOUNDS ON RELAXATIONS OF A PARALLEL MACHINE SCHEDULING PROBLEM, Journal of combinatorial optimization, 1(4), 1998, pp. 413-426
Authors:
PHILLIPS C
STEIN C
WEIN J
Citation: C. Phillips et al., MINIMIZING AVERAGE COMPLETION-TIME IN THE PRESENCE OF RELEASE DATES, Mathematical programming, 82(1-2), 1998, pp. 199-223
Authors:
PHILLIPS C
STEIN C
WEIN J
Citation: C. Phillips et al., TASK-SCHEDULING IN NETWORKS, SIAM journal on discrete mathematics, 10(4), 1997, pp. 573-598
Authors:
FIZZANO P
KARGER D
STEIN C
WEIN J
Citation: P. Fizzano et al., DISTRIBUTED JOB SCHEDULING IN RINGS, Journal of parallel and distributed computing, 45(2), 1997, pp. 122-133
Authors:
HALL LA
SCHULZ AS
SHMOYS DB
WEIN J
Citation: La. Hall et al., SCHEDULING TO MINIMIZE AVERAGE COMPLETION-TIME - OFF-LINE AND ONLINE APPROXIMATION ALGORITHMS, Mathematics of operations research, 22(3), 1997, pp. 513-544
Authors:
STEIN C
WEIN J
Citation: C. Stein et J. Wein, ON THE EXISTENCE OF SCHEDULES THAT ARE NEAR-OPTIMAL FOR BOTH MAKESPANAND TOTAL WEIGHTED COMPLETION-TIME, Operations research letters, 21(3), 1997, pp. 115-122
Authors:
SHMOYS DB
WEIN J
WILLIAMSON DP
Citation: Db. Shmoys et al., SCHEDULING PARALLEL MACHINES ONLINE, SIAM journal on computing, 24(6), 1995, pp. 1313-1331
Authors:
SHMOYS DB
STEIN C
WEIN J
Citation: Db. Shmoys et al., IMPROVED APPROXIMATION ALGORITHMS FOR SHOP SCHEDULING PROBLEMS, SIAM journal on computing, 23(3), 1994, pp. 617-632
Risultati:
1-8
|