Minimizing total weighted completion
نویسندگان
چکیده
We study the special case of the m machine ow shop problem in which the processing time of each operation of job j is equal to p j ; this variant of the ow shop problem is known as the proportionate ow shop problem. We show that for any number of machines and for any regular performance criterion we can restrict our search for an optimal schedule to permutation schedules. Moreover, we show that the problem of minimizing total weighted completion time is solvable in O(n 2) time.
منابع مشابه
An FPTAS of Minimizing Total Weighted Completion Time on Single Machine with Position Constraint
In this paper we study the classical scheduling problem of minimizing the total weighted completion time on a single machine with the constraint that one specific job must be scheduled at a specified position. We give dynamic programs with pseudo-polynomial running time, and a fully polynomial-time approximation scheme (FPTAS). 1998 ACM Subject Classification F.2.2
متن کاملSequencing to Minimize the Total Weighted Completion Times Subject to Resources and Arbitrary Precedence
We present an anlgorithm for minimizing the sum of the weighted completion times of n jobs that are subject to arbitrary precedence, when each job may require the simultaneous occupancy of a subset of m resources.
متن کاملA $(2 + \epsilon)$-approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective
We give a (2 + ǫ)-approximation algorithm for minimizing total weighted completion time on a single machine under release time and precedence constraints. This settles a recent conjecture made in [18]
متن کاملحل مسئله زمان بندی ماشینهای موازی نامرتبط با اهداف کل زودکرد وزنی و کل دیرکرد وزنی با استفاده از الگوریتم جستجوی پراکنده چند هدفه
The parallel machine scheduling problem is an important and difficult problem to be considered in the real-world situations. Traditionally, this problem consists of the scheduling of a set of independent jobs on parallel machines with the aim of minimizing the maximum job completion. In today's manufacturing systems, in which both early and tardy finishing of job processing are undesired, the o...
متن کاملMinimizing Total Weighted Completion Time on Uniform Machines with Unbounded Batch∗
In this paper, we consider the scheduling problem of minimizing total weighted completion time on uniform machines with unbounded batch. Each of the machine Ml (l = 1, ⋅ ⋅ ⋅ ,m) has a speed sl and can process up to B(≥ n) jobs simultaneously as a batch. The processing time of a batch denoted by P(B) is given by the processing time of the longest job in it, and the running time of the batch on m...
متن کامل