Branch less, cut more and minimize the number of late equal-length jobs on identical machines
نویسندگان
چکیده
منابع مشابه
Branch less, cut more and minimize the number of late equal-length jobs on identical machines
A simple greedy-type solution for a discrete optimization problem does not guarantee the optimality if the problem is sufficiently complicated. Dynamic programming is then a commonly used method, and a direct combinatorial algorithm is its reasonable alternative. Here we propose such an algorithm with some specific features, called branch less and cut more, abbreviated blesscmore. A blesscmore ...
متن کاملScheduling equal-length jobs on identical parallel machines
We study the situation where a set of n jobs with release dates and equal processing times have to be scheduled on m identical parallel machines. We show that, if the objective function can be expressed as the sum of n functions fi of the completion time Ci of each job Ji, the problem can be solved in polynomial time for any fixed value of m. The only restriction is that functions fi have to be...
متن کاملFast algorithms for preemptive scheduling of equal-length jobs on a single and identical processors to minimize the number of late jobs
We consider the preemptive scheduling of n equal-length jobs with release times and due dates with the objective to minimize the number of late jobs on a single and parallel identical processors. Our algorithm for the single-processor version is on-line and runs in time O(n log n). It produces an optimal schedule. Our multiprocessor algorithm is off-line, it has the time complexity of O(n) and ...
متن کاملScheduling jobs with equal-processing-time on parallel machines with non-identical capacities to minimize makespan
We consider the problem of scheduling a set of equal-processing-time jobs with arbitrary job sizes on a set of batch machines with different capacities. A job can only be assigned to a machine whose capacity is not smaller than the size of the job. Our goal is to minimize the schedule length (makespan). We show that there is no polynomial-time approximation algorithm with an absolute worst-case...
متن کاملBicriteria Scheduling of Equal Length Jobs with Release Dates on Identical Parallel Machines
We consider bicriteria scheduling problems on parallel, identical machines with job release dates. The jobs are assumed to have equal processing times. Our main goal in this paper is to report complexity results for bicriteria problems in this environment when the number of machines is assumed to be a fixed or constant value. The results are based on a straightforward use of the dynamic program...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2012
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2012.08.031