Tight approximations for resource constrained scheduling and bin packing
نویسندگان
چکیده
منابع مشابه
Tight Approximations for Resource Constrained Scheduling and Bin Packing
We consider the following l'esource constrained scheduling problem. Given 111. identical processors, S l'esourccs with upper hounds, 11, independent tasks of unit length l where each task has astart tüne and requires Olle processor and a task-dependeni amount of every resourcc. The optimization problem i8 1,0 schedule all tasks at dis~ crete tilncs in 1N J minilnizing the latest c.ompletion tim...
متن کاملTight Approximations for Resource Constrained Scheduling and Bin
We consider the following resource constrained scheduling problem. Given m identical processors, s resources with upper bounds, n independent tasks of unit length, where each task has a start time and requires one processor and a task-dependent amount of every resource. The optimization problem is to schedule all tasks at discrete times in II N, minimizing the latest completion time Cmax subjec...
متن کاملTight Approximations for Resource Constrained
We consider the following resource constrained scheduling problem. Given m iden-of unit length, where each job T j has a start time r j 2 II N, requires one processor and an amount R i (j) 2 f0; 1g of resource R i , i = 1; : : :; s. The optimization problem is to schedule the jobs at discrete times in II N subject to the processor, resource and start-time constraints so that the latest scheduli...
متن کاملClass constrained bin packing revisited
We study the following variant of the bin packing problem. We are given a set of items, where each item has a (non-negative) size and a color. We are also given an integer parameter k, and the goal is to partition the items into a minimum number of subsets such that for each subset S in the solution, the total size of the items in S is at most 1 (as in the classical bin packing problem) and the...
متن کاملFirst Fit bin packing: A tight analysis
In the bin packing problem we are given an instance consisting of a sequence of items with sizes between 0 and 1. The objective is to pack these items into the smallest possible number of bins of unit size. FirstFit algorithm packs each item into the first bin where it fits, possibly opening a new bin if the item cannot fit into any currently open bin. In early seventies it was shown that the a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1997
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(97)00045-0