نتایج جستجو برای: unrelated parallel machine
تعداد نتایج: 511086 فیلتر نتایج به سال:
We have a set J of n jobs, and a set M of m machines. The processing time of job i is pij on machine j. Let f : J ←M be a function that assigns each job to exactly one machine. The makespan of f is max1≤j≤m ∑ i:f(i)=j pij , where ∑ i:f(i)=j pij is the total processing time of the jobs that are assigned to machine j. In the Scheduling on Unrelated Parallel Machines problem, the goal is to find a...
This paper considers a parallel machine scheduling problem with outsourcing allowed. The objective of this problem is the combination of makespan and Outsourcing costs. In order to solve the problem, A mathematical model is proposed. Because of high computational time of mathematical model a Tabu search and PSO methods are proposed to solve the problem.
In this paper, we provide a new class of randomized approximation algorithms for scheduling problems by directly interpreting solutions to so-called time-indexed LPs as probabilities. The most general model we consider is scheduling unrelated parallel machines with release dates (or even network scheduling) so as to minimize the average weighted completion time. The crucial idea for these multi...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید