The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
In this paper, we consider a class of scheduling problems that are among the fundamental optimization problems in operations research. More specifically, we deal with a particular version called . Using the results of Hromkovič, Mömke, Steinhöfel, and Widmayer presented in their work , we analyze the problem setting for 2 jobs with an unequal number of tasks. We contribute a deterministic algorithm which achieves a vanishing delay in certain cases and a randomized algorithm with a competitive ratio...
In this paper, we consider a class of scheduling problems that are among the fundamental
optimization problems in operations research. More specifically, we deal with a particular
version called . Using the
results of Hromkovič, Mömke, Steinhöfel, and Widmayer presented in their work , we analyze the
problem setting for 2 jobs with an unequal number of tasks. We contribute a deterministic
algorithm which achieves a vanishing delay in certain cases...
Download Results (CSV)