INSTITUT FÜR INFORMATIK
|
|
- Barry Elliott
- 8 years ago
- Views:
Transcription
1 INSTITUT FÜR INFORMATIK Schedulng jobs on unform processors revsted Klaus Jansen Chrstna Robene Bercht Nr November 2011 ISSN CHRISTIAN-ALBRECHTS-UNIVERSITÄT ZU KIEL
2 Insttut für Informat der Chrstan-Albrechts-Unverstät zu Kel Olshausenstr. 40 D Kel Schedulng jobs on unform processors revsted Klaus Jansen Chrstna Robene Bercht Nr November 2011 ISSN e-mal: {j, cot}@nformat.un-el.de Parts of ths results have been publshed as extended abstract n Proceedngs of the 9th Worshop on Approxmaton and Onlne Algorthms (WAOA 2011). The research was supported by DFG project JA612/14-1, Desgn and analyss of effcent polynomal approxmaton schemes for schedulng and related optmzaton problems.
3 Abstract We study the problem of schedulng jobs on unform processors wth the objectve to mnmze the maespan. In schedulng theory ths problem s nown as Q C max. We present an EPTAS for schedulng on unform machnes avodng the use of an MILP or ILP solver. Instead of solvng (M)ILPs we solve the LPrelaxaton and use structural nformaton about the closest ILP soluton. For a gven LP-soluton x we consder the dstance to the closest ILP soluton y n the nfnty norm,.e. x y. We call ths dstance max -gap(a δ ), where A δ s the constrant matrx of the consdered (I)LP. For dentcal machnes and δ = Θ(ε) the matrx A δ has ntegral entres n {0,..., (1 + δ)/δ} and O(1/δ log(1/δ)) rows representng job szes and 2 O(1/δ log2 (1/δ)) columns representng confguratons of jobs, so that the column sums are bounded by (1 + δ)/δ. The runnng-tme of our algorthm s 2 O(1/ε log(1/ε) log(c(aδ)) + O(n log n) where C(A δ ) denotes an upper bound for max -gap(a δ ). Furthermore, we can generalze the algorthm for unform machnes and obtan a runnng-tme of 2 O(1/ε log(1/ε) log(c(ãδ)) + poly(n), where Ãδ s the constrant matrx for a sub-problem consdered n ths case. In both cases we show that C(A δ ), C(Ãδ) 2 O(1/ε log2 (1/ε)). Consequently, our algorthm has runnng-tme at most 2 O(1/ε2 log 3 (1/ε)) + O(n log n) for dentcal machnes and 2 O(1/ε2 log 3 (1/ε)) + poly(n) for unform machnes, the same as n [12]. But, to our best nowledge, no nstance s nown to tae on the value 2 O(1/ε log2 (1/ε)) for max -gap(a δ ) or max -gap(ãδ). If C(Ãδ), C(A δ ) poly(1/ε), the runnng-tme of the algorthm would be 2 O(1/ε log2 (1/ε)) + poly(n) and thus mprove the result n [12]. 1 Introducton In ths paper we study the problem of schedulng jobs on unform processors wth the objectve to mnmze the maespan. In schedulng theory ths problem s nown as Q C max and s formally descrbed as follows. We are gven a set J of n Jobs J j wth processng tmes p j and a set P of m processors P, each of them runnng wth a certan speed s. A job J j needs p j /s tme unts to be fnshed, f t s executed on P. Wthout loss of generalty we assume that the number m of processors s bounded by the number n of jobs and that the processors are sorted by decreasng speed,.e. s 1 s 2... s m. For an nstance I let OP T (I) denote the length of an optmum schedule A polynomal tme approxmaton scheme (PTAS) for Q C max s a famly of polynomaltme approxmaton algorthms (A ε ) ε>0, where for an nstance I the output of each algorthm A ε s a schedule of length (1+ε)OP T (I) and the runnng-tme of A ε s bounded by a polynomal n the nput length I. The runnng-tme of every A ε s allowed to be exponental n 1/ε, whch can lead to very large runnng-tmes f ε s very small. Therefore we dstngush furthermore effcent polynomal-tme approxmaton schemes (EPTAS) that have runnng-tme bounded by f(1/ε)poly( I ) for a functon f, and fully polynomal-tme approxmaton schemes (FPTAS) wth runnng-tme bounded by a polynomal n both, 1/ε and I. Known Results. In [5] and [6] the problem was shown to be NP-hard even for dentcal processors. In 1976 Horowtz and Sahn [11] presented an approxmaton scheme for a 3
4 constant number m of unform processors. Later Gonzales et al. [5] showed for the same problem that the LPT lst algorthm (usng largest processng tme frst polcy) has output n [1.5 OP T (I), 2 OP T (I)]. Hochbaum and Shmoys presented a PTAS for Q C max wth runnng-tme (n/ε) O(1/ε2) [9],[10]. For dentcal processors the complexty was mproved to (n/ε) O(1/ε log(1/ε)) by Leung [18]. Snce the problem was shown to be NPhard n the strong sense [5], no FPTAS exsts. But, for dentcal processors Hochbaum [8] and Alon et al. [1] developed an EPTAS wth runnng-tme f(1/ε) + O(n), where f s a functon doubly exponental n 1/ε. In [12] Jansen gave an EPTAS for schedulng jobs on unform processors usng an MILP relaxaton wth runnng-tme 2 O(1/ε2 log 3 (1/ε)) + poly(n). Sanders et al. obtaned a robust onlne algorthm for schedulng on dentcal machnes wth compettve rato (1 + ε) and mgraton factor β(ε) = 2 O(1/ε log2 (1/ε)) so that the runnng-tme for ncorporatng a newly arrved job s constant. It mantans and updates a data structure n tme doubly exponental n 1/ε, namely 2 2O(1/ε log2 (1/ε)), n each teraton. Ths s done by comparng the dstance between solutons for ILPs wth dfferent rght hand sdes. The general case for unform processors s not consdered. Our Results. In ths wor we present an EPTAS for schedulng on unform machnes avodng the use of an MILP or ILP solver. In our new approach nstead of solvng (M)ILPs we solve the LP-relaxaton and use structural nformaton about the closest ILP soluton. For a gven LP-soluton x we consder the dstance to the closest ILP soluton y n the nfnty norm,.e. x y. For the constrant matrx A δ of the consdered LP we call ths dstance max -gap(a δ ) := max{mn{ y x : y soluton of ILP} : x soluton of LP}. Let C(A δ ) denote an upper bound for max -gap(a δ ). The runnng-tme of our algorthm s 2 O(1/ε log(1/ε) log(c(a δ)) + poly(n). We show that C(A δ ) 2 O(1/ε log2 (1/ε)). Consequently, our algorthm has runnng-tme at most 2 O(1/ε2 log 3 (1/ε)) + poly(n), the same as n [12]. But, to our best nowledge, no nstance s nown to tae on the value 2 O(1/ε log2 (1/ε)) for max - gap(a δ ). We conjecture C(A δ ) poly(1/ε). If that holds, the runnng-tme of the algorthm would be 2 O(1/ε log2 (1/ε)) + poly(n) and thus mprove the result n [12]. Methods. Assume that we are gven an nstance Ī of m dentcal processors and n jobs wth only d dfferent processng tmes p j, such that there are n j jobs of each sze. We use the dual approxmaton method by Hochbaum and Shmoys [10] to fnd a value T for the optmum maespan and transform the schedulng problem nto a bn pacng problem wth bn sze T. Then the problem can be descrbed va the followng confguraton ILP for d dfferent tem szes: x m a(j, )x n j for j = 1,..., d x Z 0. (ILP (d)) A confguraton C s a multset of processng tmes p j so that ther total sum s bounded by T. The nteger a(j, ) denotes the number of jobs of processng tme p j n C. In ILP (d) 4
5 the varable x s the number of bns n whch jobs are paced accordng to confguraton C. Solvng an ILP s always dffcult [15, 16], so what nd of nformaton about the structure of the ILP-soluton can we get from a soluton of the LP-relaxaton? For the constrant matrx A := (a(j, )) j of the above ILP (d) we consder max -gap(a). Havng an upper bound C(A) for max -gap(a) and havng an optmum fractonal soluton x we conclude that there exsts an optmum soluton y of ILP (d) so that y x C(A) for x C(A). So we now how a subset of the bns B B has to be flled wth jobs n the optmum soluton y. We can reduce the nstance to an nstance Īred by tang out the bns n B and those jobs that are paced n B : m := m x C(A) processors x >C(A) ñ j := n j (1) a(j, ) x C(A) for all processng tmes p j. x >C(A) In Fgure 1 for example we have C(A) = 3. Gven an optmum fractonal soluton x we conclude that there exsts an optmum soluton y of the ILP wth x y 3. Thus, f x = 7.5 we have y 5. Therefore we now that there s an ntegral soluton of ILP (1) where at least 5 bns are occuped wth confguraton C. We tae out these 5 bns and the correspondng jobs. Keep n mnd that f the number of dfferent C(A δ ) = 3 and x = 7.5 y 5 Fgure 1: Reducng the nstance. job szes and the number of jobs per bn s bounded by a constant, the total number of remanng jobs n Īred can be bounded by a functon n the value C(A) namely by #(non-zero varables n LP-soluton) #(jobs per bn) C(A). Coo et al. [3] showed for general (I)LPs that max -gap(a) s bounded by tmes the number of varables, where s the maxmum absolute value of a subdetermnant of the constrant matrx A. So for an nstance I wth dentcal machnes our algorthm (for a formal descrpton see Algorthm 1) frst chooses δ Θ(ε) and fnds by bnary search a canddate T for the maespan wth OP T (I) T (1 + δ)op T (I). By scalng we can assume that T = 1 and round the processng tmes p j to values p j = δ(1 + δ) j wth j Z such that p j p j (1 + δ)p j. Consequently, we have to enlarge the bn capactes slghtly to (1 + δ)t = (1 + δ). Wth Ī we denote the nstance of rounded jobs, that are large,.e. p j > δ. Notce that we have at most O(1/δ) large jobs per bn and by the roundng we have R O(1/δ log(1/δ)) dfferent large job szes (see also Lemma 2.1). We set up a confguraton ILP for Ī wth 2 O(1/δ log2 (1/δ)) varables and constrant matrx A δ as descrbed above and solve the LPrelaxaton or decde that no soluton exsts. In the latter case we ncrease the value T 5
6 and restart. Solvng the LP-relaxaton can be done n tme poly(1/δ, log n) [7]. Usng the theorem by Coo et al. [3] we show that C(A δ ) s at most 2 O(1/δ log2 (1/δ)) (refer to Lemma 2.3). Havng a soluton of the LP-relaxaton we can reduce the nstance as descrbed n equaton (1). Snce the number of non-zero varables n a basc soluton of the LPrelaxaton s bounded by ran(a δ ) O(1/δ log(1/δ)), the number of remanng large jobs n Īred s bounded by 2 O(1/δ log(1/δ) log(c(a δ)/δ)). We allocate them by a dynamc programmng approach. If ths fals, we ncrease T and restart. In the end the small jobs are added greedly. The runnng-tme s composed as follows sortng the tems by sze + bnary search on T solvng the LP dynamc program + addng small jobs. Ths gves total runnng-tme O(n log n) + O(log(1/ε))poly(1/ε, log n)2 O(1/ε log(1/ε) log(c(a δ))) + O(n) O(n log n) + poly(log n)2 O(1/ε log(1/ε) log(c(a δ))) 2 O(1/ε log(1/ε) log(c(a δ))) + O(n log n). The algorthm for unform processors s much more complex. Snce we have dfferent bn capactes for unform machnes, we cannot drectly apply the technques used for dentcal machnes. Therefore, we dstngush between three dfferent scenaros for the shape of the bn szes. For each scenaro we gve an algorthm that solves the problem n tme 2 O(1/δ log(1/δ) log(c(ãδ))) + poly(n) that apples our new technque to a subset of the nstance. Furthermore, we use a new technque to round LP solutons for fractonal bn pacng producng only few extra bns. In all cases the runnng tme depends on C(Ãδ) and s 2 O(1/ε2 log 3 (1/ε)) + poly(n) n the worst case for C(Ãδ). Here, the matrx Ãδ descrbes the constrants appearng n an ILP-approach that characterzes a more general schedulng problem as the one for dentcal machnes: the jobs have a bounded number of dfferent szes and the machnes run group-wse wth the same speed, so we have confguratons for each group. The entres of à δ are ntegers n {0, 1,..., (1 + δ)g(1/δ)/δ} and the column sums are bounded by (1 + δ)g(1/δ)/δ + 1 for a functon g(1/δ) = poly(1/δ) that wll be specfed later. The value C(Ãδ) s an upper bound for max -gap(ãδ). We found out that the value for matrces descrbng schedulng problems can be exponental n the number of dfferent tem szes (see Lemma 2.5). But, no nstance s nown to tae on the upper bound for max -gap(a δ ) or max -gap(ãδ). Therefore, an open queston s to fnd a better bound for max -gap(a δ ) and max -gap(ãδ). One can also thn of a robust onlne algorthm for dentcal processors or even for unform processors wth mproved runnng-tme usng smlar technques. Organzaton of the paper. In Secton 2 we descrbe the algorthm for dentcal processors fully detaled. Moreover, we show that max -gap(a δ ) s bounded from above and that the value s bounded from below. In Secton 3 we present an effcent algorthm for unform processors that avods to solve (M)ILPs and uses an upper bound for max -gap(ãδ) nstead. Here, we proceed by case dstncton and consder three dfferent scenaros for the bn szes. Consequently, a subdvson of Secton 3 s gven by the three cases. 2 Schedulng on Identcal Processors An overvew about our algorthm s gven n Algorthm 1. Below we descrbe our approach step by step. 6
7 Algorthm 1 Algorthm for dentcal machnes 1: Obtan wth lst schedulng algorthm a schedule of length LS(I) 2OP T (I). 2: Compute a value T [LS(I)/2, LS(I)]. 3: Round the processng tmes of the jobs and dstngush small and large jobs 4: Solve an LP-relaxaton and fnd a schedule for a subset of the large jobs and reduce the nstance to I red. 5: f LP has no feasble soluton then 6: ncrease T and go to step 3. 7: end f 8: Dynamc program for I red. 9: f the dynamc program for I red does not fnd a feasble soluton for m machnes then 10: ncrease T and go to step 3. 11: end f 12: Schedule the small jobs behnd the large ones.. Computng an approxmate value for the maespan. We frst compute a near optmum value T for the maespan. Let LS(I) be the length of a schedule generated by the lst schedulng algorthm wth LS(I) 2OP T (I) where OP T (I) s the mnmum schedule length among all solutons. Ths mples that LS(I)/2 OP T (I) LS(I). In the followng we choose a value δ mn(ε/4, 1/2). Usng bnary search over the nterval [LS(I)/2, LS(I)] we compute a value T such that OP T (I) T (1 + δ)op T (I). Notce that the nterval [LS(I)/2, LS(I)] can be dvded nto 1/δ subntervals of length (δ/2)ls(i) δop T (I). To fnd the correspondng nterval, we use the dual approxmaton method by Hochbaum and Shmoys [9] that for a gven value T ether computes an approxmate schedule of length at most T (1 + δ) or shows that there s no schedule of length T. Usng bnary search over the nterval, we compute a value T (1 + δ)op T (I) and an approxmate schedule below of length at most (1+2δ)T (1+2δ)(1+δ)OP T (I) (1+4δ)OP T (I) (1+ε)OP T (I) for δ 1/2 and δ ε/4. Notce that O(log(1/ε)) steps are suffcent n the bnary search. Roundng. As descrbed n the ntroducton the schedulng problem can be transformed nto a bn pacng problem wth bn szes T [2]. By scalng we may assume that T = 1. Let Ī be the nstance wth the rounded processng tmes. Clearly, for any set A of jobs wth j A p j 1 we have for the total rounded processng tme j A p j (1 + δ). We partton the jobs now nto large and small jobs. A job j s large, f the processng tme p j δ. Other jobs wth p j < δ are called small. Lemma 2.1. Let A be a set {a(1 + δ) x,..., a(1 + δ) y } wth x, y Z +, x < y and a IR +. Then A log(max(a)/ mn(a))/δ + 1 and A 2 log(max(a)/ mn(a))/δ + 1 for any δ (0, 1/2]. Proof. Usng the assumpton on A, max(a)/ mn(a) = (1 + δ) y x. Therefore, the number of elements a(1 + δ) n A s equal to y x + 1 = log(max(a)/ mn(a))/ log(1 + δ)
8 Usng log(1 + δ) δ δ 2 δ/2 for δ (0, 1/2] and log(1 + δ) δ, the cardnalty of A s at least log(max(a)/ mn(a))/δ + 1 and at most 2 log(max(a)/ mn(a))/δ + 1. By the lemma above the number of dfferent large rounded processng tmes s bounded by R = 2 log((1 + δ)/δ)/δ + 1 = O(1/δ log(1/δ)). Wth n j we denote the number of jobs n Ī wth processng tme δ(1 + δ)j for j = 0,..., R 1. (I)LP-formulaton for large jobs The assgnment of the large jobs to the bns can be formulated as a confguraton ILP as n ILP (d) for d = R wth exponentally many varables. We denote t wth ILP (R). Here a confguraton s a multset of large rounded processng tmes,.e. values δ(1 + δ) j [δ, (1 + δ)] so that ther total sum s bounded by 1 + δ. Snce there are at most (1 + δ)/δ many large jobs on a processor wth maespan (1 + δ), the number of multsets wth large processng tmes s bounded by ((1 + δ)/δ) O(1/δ log(1/δ)) = 2 O(1/δ log2 (1/δ)). Let a(j, ) be the number of occurrences of value δ(1 + δ) j n C. Consequently the matrx A δ := (a(j, )) j s the constrant matrx of ILP (R). To avod now the algorthm by Lenstra or Kannan to compute an optmum soluton of ILP (R), we consder ts LP-relaxaton LP (R). We can solve LP (R) usng Theorem (6.6.5) n [7]: The frst constrant of LP (R) can be transformed nto an objectve { functon mn cx wth R 1 c 1. The resultng dual s a maxmzaton problem of the form max j=0 n jy j y P }, { where P = y R R } j a(j, )y j 1, 1 C, y 0. The polyhedron P has facet complexty at most ϕ := R( log( 1+δ ) + 1) + 2 = O(1/δ δ log2 (1/δ)), snce each nequalty descrbng P has encodng length at most ϕ. Accordng to Theorem (6.6.5) n [7] there s an algorthm that fnds a basc optmum soluton of the dual of the dual,.e. the modfed LP (R). The runnng-tme s bounded by a polynomal n ϕ and n the encodng length of (n 0,..., n R 1 ), whch s n O(1/δ log(1/δ) log(n)). Thus, the runnng-tme s bounded by poly(1/δ, log(n)). Reducng the nstance of large jobs. Let x be an optmum basc soluton of LP (R) and let C(A δ ) be an upper bound for max -gap(a δ ). Let Īred be the correspondng reduced nstance acheved as n (1). From x we obtan a pacng for the large rectangles n Ī\Īred as descrbed n the ntroducton. Now, each basc soluton of the LP-relaxaton has at most O(1/δ log(1/δ)) many varables wth value larger than 0. In addton the reduced varables x x C(A δ ) are bounded by C(A δ ). Snce j a(j, ) (1+δ)/δ for each confguraton C, we can bound the number of remanng jobs n Īred,.e. ñ O(1/δ 2 log(1/δ)c(a δ )). Furthermore, we may suppose that m ñ; snce more processors are not necessary. Dynamc program for reduced nstance. An assgnment of the remanng jobs n I red can be computed va dynamc programmng n tme (ñ) O(1/δ log(1/δ)) 2 O(1/δ log(1/δ) log(c(a δ)/δ)). We smply go over the machnes and store vectors (x 1,..., x R ) wth numbers x j of jobs wth processng tme p j for j = 1,..., R used by the frst processors for = 1,..., m. If the algorthm does not fnd a feasble assgnment, we now that the orgnal ILP (R) has no feasble soluton and have to ncrease T. 8
9 Small jobs. Once we have an assgnment of the large jobs, we can pac the small jobs. They can be paced greedly onto the processors, f the total sze of the small and large jobs s bounded by m (the total sum of all bn capactes). Addng the small jobs ncreases the maespan by at most δ. Therefore, the overall maespan s at most (1 + 2δ). If the condton above does not hold or f p max = max j=1,...,n p j > 1, there s no schedule of length T = Bounds for max -gap(a δ ) and the runnng-tme To obtan an upper bound C(A δ ) for max -gap(a δ ) we use an nterestng result by Coo et al. [3]. They proved that the maxmum dstance between an optmum soluton of the LP and a closest optmum soluton of the ILP (and vce versa) s bounded by a functon n the dmenson and the coeffcents of the underlyng matrx. Theorem 2.2. [3] Let A be an ntegral (M N) matrx, such that each subdetermnant s at most n absolute value, and let b and c be vectors. Suppose that both objectve values () mn{c T x Ax b} and () mn{c T x Ax b; x Z N } are fnte. Then: (a) for each optmum soluton y of () there exsts an optmum soluton z of () wth y z N and (b) for each optmum soluton z of () there exsts an optmum soluton y of () wth y z N. Note that the theorem above also holds, f we have addtonal nequaltes of the form x 0. Furthermore, we can use c T x = x as objectve functon nstead of the nequalty x m n ILP (d). For schedulng on dentcal processors the objectve values of the ILP formulaton for the rounded large jobs Ī and ts LP relaxaton both are fnte. Consequently, max -gap(a δ ) s bounded by N. In the followng we gve bounds for the parameters N and. Lemma 2.3. The number of varables N n the modfed ILP, the maxmum absolute value over all subdetermnants correspondng to the matrx A δ and max -gap(a δ ) are at most 2 O(1/δ log2 (1/δ)). Proof. The number N of varables n the modfed ILP s equal to the number of confguratons, so t s bounded by 2 O(1/δ log2 (1/δ)). On the other hand, the absolute value of the determnant of a quadratc (M M) sub-matrx A of A δ wth column vectors A 1,..., A M and det(a) = can be bounded usng the Hadamard s nequalty det(a) M A 2. (2) =1 Snce the coeffcents of a column A correspond to a confguraton C, the sum of the entres s bounded by (1 + δ)/δ. Therefore, usng the nequalty A 2 A 1, we obtan A 2 A 1 O(1/δ log(1/δ)) j=1 9 a(j, ) (1 + δ)/δ. (3)
10 Ths mples that s at most (2) O(1/δ log(1/δ)) =1 O(1/δ log(1/δ)) (3) A 2 =1 (1 + δ) δ = 2 O(1/δ log2 (1/δ)). (4) We conclude that max -gap(a δ ) s also at most 2 O(1/δ log2 (1/δ)). Ths mples the followng theorem Theorem 2.4. For a lst of n jobs I Algorthm 1 produces a schedule on m machnes wth maespan at most (1 + ε)op T (I) n tme 2 O(1/ε log(1/ε) log(c(a δ))) + O(n log n) 2 O(1/ε2 log 3 (1/ε)) + O(n log n). If C(A δ ) = poly(1/ε), the runnng-tme mproves to 2 O(1/ε log2 (1/ε)) + O(n log n). On the other hand, the value can be qute large. But note that a lower bound for max -gap(a δ ) remans unnown. Lemma 2.5. The maxmum value over all subdetermnants of the coeffcent matrx A δ = (a(j, )) s at least 2 Ω(1/δ log2 (1/δ)). Proof. The number of rounded processng tmes p j n the nterval [δ, δ 1/2 ] s at least log(δ 1/2 /δ)/δ = 1/δ log(δ 1/2 ). For each rounded processng tme p j = δ(1 + δ) j [δ, δ 1/2 ] for j = 0,..., 1/δ log(δ 1/2 ) 1, we tae one confguraton or multset C j whch conssts of only δ 1/2 numbers p j,.e. C j = {0 : δ(1 + δ) 0,..., 0 : δ(1 + δ) j 1, δ 1/2 : δ(1 + δ) j, 0 : δ(1 + δ) j+1,..., 0 : δ(1 + δ) 1/δ log(δ 1/2 ) 1 }. The determnant of the matrx correspondng to these confguratons C 0,..., C 1/δ log(1/δ 1/2 ) 1 s (δ 1/2 ) Ω(1/δ log(δ 1/2 )) = 2 Ω(1/δ log2 (δ 1/2 )) = 2 Ω(1/δ log2 (1/δ)). Ths mples that 2 Ω(1/δ log2 (1/δ)). 3 Schedulng on Unform Processors For unform processors we can compute a 2 - approxmaton usng the LPT algorthm studed by Gonzales et al. [5]. Here LP T (I) 2OP T (I) where LP T (I) s the schedule length generated by the LPT algorthm. Smlar to dentcal processors, we can splt the nterval [LP T (I)/2, LP T (I)] nto 1/δ subntervals of length (δ/2)lp T (I) δop T (I) and transform the schedulng problem wth maespan T nto a bn pacng problem wth bn szes c 1... c m (where c = T s ). By scalng we assume c m = 1. As for dentcal machnes we round the job szes p j to values p j = δ(1 + δ) j (1 + δ)p j. Addtonally we round and ncrease slghtly the bn capactes c to values c = (1 + δ) l c (1 + δ) 2. Let the nstance of rounded jobs and bn capactes be denoted wth Ī. For a set of bns B let c mn (B) := mn{c b B}. Analogously we defne c max (B). 10
11 Lemma 3.1. [12] If there s a feasble pacng of n jobs wth processng tmes p j nto m bns wth capactes c 1,..., c m, then there s also a pacng of the n jobs wth rounded processng tmes p j = δ(1 + δ) j (1 + δ)p j nto the m bns wth rounded bn capactes c = (1 + δ) l c (1 + δ) 2. In the general case wth dfferent bn szes, we dstngush between three dfferent scenaros dependng on the structure of the set of bns n the nstance. Let g : N N and f : N N be functons so that g(1/δ) 1/δ log 2 (1/δ) wth g = poly(1/δ) and f(1/δ) = max{ (1 + δ + log 2 (1/δ))/δ, 1/δ 4 log(g(1/δ)/δ)c(ãδ)}. The constant C(Ãδ) s stll an upper bound for max -gap(ãδ). Here Ãδ s a matrx correspondng to a more general schedulng problem wth O(1/δ log(1/δ)) rows (dfferent job szes) and 2 O(1/δ log2 (1/δ)) columns (confguratons) wth ntegral entres n {0, 1,..., (1 + δ)g(1/δ)/δ} and column sums bounded by (1 + δ)g(1/δ)/δ + 1 smlar to the constrant matrx of the confguraton ILP used for dentcal processors. We consder the followng three scenaros: Case 1: For all {1,..., m} we have c 1 / c m g(1/δ). Case 2: There exsts an ndex K + 1 f( 1 /δ) wth c 1 / c < g( 1 /δ) for 1 K and c 1 / c g( 1 /δ) for K + 1 m. Case 3: There exsts an ndex K + 1 > f( 1 /δ) wth c 1 / c < g( 1 /δ) for 1 K and c 1 / c g( 1 /δ) for K + 1 m. In the frst scenaro all bns have smlar capactes. More precsely the capacty of every bn s bounded from above by g( 1 /δ) (Keep n mnd that c mn := mn c = 1). Ths scenaro can be solved very smlar to the problem wth dentcal machnes. In the second scenaro we consder two dfferent bn groups B 0 := {b 1,..., b K } and B 1 := {b K+1,..., b m }. For B 0 we preprocess an assgnment of large jobs ( p j > δc mn (B 0 )) va a dynamc program and obtan a set of assgnment vectors V. If the dynamc program does not fnd a feasble soluton for B 0, we ncrease T. For v V we allocate large jobs fractonally nto B 1 va an LP. If the LP does not have a feasble soluton we compute a dfferent vector v. If we stll do not fnd an LP soluton, we ncrease T. Then we round the soluton of the LP wth a novel roundng technque usng a subroutne for bn pacng wth dfferent bn szes that produces only few extra bns. In the end the small jobs are scheduled behnd the large ones. An overvew of the overall algorthm gves Algorthm 2. The thrd scenaro s the most complcated case. Here we have three bn groups B 0 = {b 1,..., b K }, B 1 = {b > K, c δc mn (B 0 )} and the remanng bns B 2 = B \ (B 0 B 1 ). If B 1 we dstngush large, medum and small jobs, else we only have large and small jobs: A job s called large f p j > δc mn (B 0 ) and medum f p j (δc mn (B 1 ), δc mn (B 0 )]; other jobs are called small. We frst allocate a subset of the large jobs nto B 0 and B 1 usng a lnear program. As n the case for dentcal machnes for a gven soluton x of the LP we reduce the nstance by the number of large jobs surely paced n the closest ntegral soluton. If the LP has no feasble soluton we have to ncrease T and restart. Va dynamc programmng our algorthm obtans an assgnment of the remanng large jobs nto B 0 and B 1 (f there s none, ncrease T ). The medum jobs are paced wth a bn pacng subroutne nto B 1. Fnally, the allocated medum and large jobs are ft together wth the remanng jobs and the small jobs are added. An overvew of the algorthm for 11
12 ths case s gven n Fgure 3. In the next followng we descrbe the algorthm n each case fully detaled. 3.1 Algorthm for Case 1 Usng Lemma 2.1, the number of dfferent rounded bn szes s at most L = 2/δ log(g(1/δ))+ 1, snce g(1/δ) = poly(1/δ) we have L = O(1/δ log(1/δ)). In ths scenaro a job s called large, f p j = δ(1 + δ) j δ c m = δ, otherwse a t s called small. Let p mn be the mnmum large processng tme,.e. p mn = mn{p j p j δ, j = 1,..., n}. Clearly, p mn δ f the set s non-empty. Snce p max = max j=1,...,n p j c 1 g(1/δ), we obtan p max / p mn g(1/δ)/δ. Thus, the total number of dfferent rounded large processng tmes s at most R = 2/δ log(g(1/δ)/δ) + 1. Snce g(1/δ) = poly(1/δ) we obtan R = O(1/δ log(1/δ)). Let n j be the number of jobs wth processng tme δ(1 + δ) j for j = 0,..., R 1 and let m l be the number of bns wth capacty or bn sze c l = (1 + δ) l 1 for l = 1,..., L. All bns wth capacty (1 + δ) l 1 form a bloc B l of dentcal bns. The overall algorthm wors very smlar to the one n the dentcal case. Allocatng large jobs. For the the assgnment of the large jobs to the bns, we set up an nteger lnear program, whch s bloc by bloc smlar as the one for the case of dentcal machnes. Here we ntroduce for each bn sze l {1,..., L} confguratons C l C l as multsets of numbers δ(1 + δ) j [δ, c l ], where the total sum s bounded by c l for l = 1,..., L. Furthermore, let a(j, (l) ) be the number of occurrences of processng tme δ(1 + δ) j n confguraton C (l). In the ILP below we use an ntegral varable x (l) to ndcate the number of confguratons C (l) n bloc B l.,l x (l) m l for l = 1,..., L a(j, (l) )x (l) n j for j = 0,..., R 1 x (l) Z 0 for = 1,..., C (l), l = 1,..., L The number of constrants of the ILP (not countng the non-negatvty constrants x (l) 0) s at most R + L O(1/δ log(1/δ)) and the number of varables s bounded by (g(1/δ)/δ) O(1/δ log(1/δ)) 2 O(1/δ log2 (1/δ)), snce g(1/δ) = poly(1/δ). To apply Theorem 2.2, we multply the frst L nequaltes by ( 1) and obtan ( 1)x(l) m l for l = 1,..., L. Let Ãδ be the matrx wth column vectors A (l) correspondng to varables x (l),.e. A (l) = (0,..., 0, 1, 0,..., 0, a(1, (l) ),..., a(r, (l) )) T. Agan, let C(Ãδ) be an upper bound for max -gap(ãδ). Suppose that there s feasble soluton of the ILP. Our algorthm frst solves the correspondng LP relaxaton smlar as for dentcal machnes: Snce g(1/δ) = poly(1/δ) the polyhedron correspondng to the dual has facet complexty bounded by O(1/δ log 2 (1/δ)) and the prce vector of the dual has encodng length at most O(1/δ log(1/δ) log(n)). Thus, accordng to Theorem n [7] we fnd a basc optmum 12
13 soluton of the LP relaxaton n tme poly(1/δ, log(n)). (y (l) Snce the ILP s feasble, the LP relaxaton has a feasble soluton ( x (l) ), too. Let ) be a feasble soluton of the ILP wth dstance (n the maxmum norm) bounded by x (l) C(Ãδ) for all. Such a soluton y exsts snce both, LP and ILP are feasble. If x l > C(Ãδ) we set y (l) = x (l) C(Ãδ) and use y (l) confguratons of type for bloc B l. Now we can reduce the nstance as follows: C(Ãδ),.e. y (l) C (l) m l := m l ñ j := n j : x (l) >C(Ãδ),l: x (l) >C(Ãδ) x (l) C(Ãδ) bns n bloc B l for l = 1,..., L a(j, (l) ) x (l) C(Ãδ) jobs wth rounded processng tmes δ(1 + δ) j for j = 0,..., R 1. Let I red be the reduced nstance. Notce that each basc feasble LP soluton ( x (l) ) has at most O(1/δ log(1/δ)) varables wth value strctly larger than 0. Snce c max g( 1 /δ) the coeffcents of the constrant matrx of the ILP a(j, (l) ) are bounded by g( 1/δ)/δ. By C(Ãδ) n the LP are bounded by C(Ãδ). Thus, the total number ñ = j ñj of remanng jobs s at most O( (C(Ãδ)g(1/δ))/δ 2 log(1/δ)). Furthermore, an assgnment of the remanng large jobs can be computed va a dynamc program n tme constructon the reduced varables x (l) x (l) ( ) C(Ãδ )g(1/δ) log(1/δ) (ñ) O(1/δ log(1/δ)) O(1/δ log(1/δ) log δ 2 2 ). If the algorthm does not fnd a feasble assgnment, then we now that the orgnal ILP has no feasble soluton. Upper bound for max -gap(ãδ). upper bound for max -gap(ãδ). Here we can use agan Theorem 2.2 to acheve an Lemma 3.2. The maxmum absolute value of a subdetermnant of matrx Ãδ max -gap(ãδ) are bounded by 2 O(1/δ log2 (1/δ)). and Proof. Usng A (l) 1 = R j=1 a(j, (l) ) + 1 g( 1 δ ) /δ + 1 we obtan A (l) 2 g( 1 δ ) /δ + 1 and wth Hadamard-nequalty ( g( 1 δ ) /δ + 1) O(1/δ log(1/δ)) 2 O(1/δ log2 (1/δ)). Snce the number of varables N 2 O(1/δ log2 (1/δ)) and the maxmum dstance max -gap(ãδ) can be bounded by N the asserton follows wth Theorem 2.2. Agan 2 Ω(1/δ log2 (1/δ)) and stll a lower bound for max -gap(ãδ) s open. The upper bound mples that the runnng-tme of the dynamc program s n 2 O(1/δ2 log 3 (1/δ)), moreover ths mples the followng theorem 13
14 Theorem 3.3. For the scenaro n case 1 there s an algorthm that schedules n jobs on m unform processors producng a schedule wth maespan at most (1+ε)OP T (I) n tme 2 O(1/ε2 log 3 (1/ε)) poly(log(n)) + O(n log(n)). If C(A) = poly(1/ε) the runnng-tme mproves to 3.2 Algorthm for Case 2 2 O(1/ε log2 (1/ε)) poly(log(n)) + O(n log(n)). We dvde the bns nto two groups B 0 := {b 1,..., b K } and B 1 := {b K+1,..., b m }. There s a gap g(1/δ) between the largest bn b 1 and bn b K+1, compare to Fgure 2. In partcular we have c 1 / c < g(1/δ) for b B 0 and c 1 / c g(1/δ) for b B 1. A job s called large, f p j δc mn (B 0 ), other jobs are small. < g(1/δ) g(1/δ) 1 2 K K + 1 m B 0 B 1 Fgure 2: Shape of bns n case 2. Preprocessng large jobs for B 0. We frst compute the set of large jobs scheduled n group B 0. Therefore we use a dynamc programmng approach as follows. Wth Lemma 2.1 we conclude that the number of dfferent rounded bn szes n B 0 s at most O(1/δ log(g(1/δ))) and the number q of dfferent large job szes s at most O(1/δ log(g(1/δ)/δ)). Snce g(1/δ) = poly(1/δ) both numbers are n O(1/δ log(1/δ)). Furthermore, the total number of large jobs paced nto B 0 s bounded by (K/δ)g(1/δ). A possble choce of large jobs for the frst K bns can be descrbed by a vector v = (v 1,..., v q ) where v j s the number of jobs wth processng tme r j paced nto B 0. Snce v j Kg(1/δ)/δ, g(1/δ) O(poly(1/δ)) and K f(1/δ) = O(C(Ãδ)), the total number of possble vectors s at most 2 O(1/δ log(g(1/δ)/δ) log(kg(1/δ)/δ)) 2 O(1/δ log(1/δ) log(c(ãδ)). By a dynamc program we compute the set of all possble vectors and correspondng pacngs nto the K bns wth runnng-tme 2 O(1/δ log(1/δ) log(c(ãδ))) = 2 O(1/δ2 log 3 (1/δ)), whch mproves to 2 O(1/δ log2 (1/δ)), f K O(1/δ). Smply go over the machnes and store the possble vectors for the frst machnes for = 1,..., K. Notce that all huge jobs wth processng tme larger than or equal to c mn (B 0 ) have to be placed nto B 0. Consequently, a vector v s feasble, f v corresponds to a pacng nto the K bns and f all huge jobs are placed nto B 0. Let S 0 be the free space K =1 c q j=1 r jv j n B 0. 14
15 Algorthm 2 Algorthm for case 2 1: Obtan 2 - approxmaton usng the LPT algorthm and compute a value T [LP T (I)/2, LP T (I)]. 2: Round the processng tmes and bn capactes and get rounded nstance Ī. 3: Preprocess assgnment of large jobs ( p j δ) for B 0 va dynamc programmng and obtan feasble assgnment vector v. 4: f the dynamc program does not fnd a feasble soluton for B 0 then 5: ncrease T and go to step 2. 6: end f 7: Allocate large jobs fractonally nto B 1 va an LP. 8: f the LP does not have a feasble soluton then 9: go bac to step 3 (and compute a dfferent vector v). 10: end f 11: Round soluton of the LP wth new roundng technque usng a subroutne for bn pacng wth dfferent bn szes. 12: Schedule the small jobs ( p j < δ) behnd the large ones slghtly ncreasng the bns szes. Allocatng large jobs nto B 1. Notce that tny jobs wth processng tmes p j < δc mn (B 0 ) can be neglected. These jobs can be placed greedly nto slghtly enlarged bns n the last phase of the algorthm. Now we choose and pac the remanng jobs for S 0 and B 1 va a lnear program relaxaton smlar as n the case of dentcal machnes. Here the gap g(1/δ) wll be helpful to move some jobs later nto B 0. We dvde the set of all bns n B 1 nto N groups B l wth m l bns of the same sze c(l). to ndcate the fractonal length of a multset C (l) of large processng tmes p j [δ c(l), c(l)] paced nto bns of sze c(l). Let a(j, (l) ) be the number of the occurrences of p j n C (l) and let sze(c (l) ) = j a(j, (l) ) p j. Furthermore, let n j be the number of jobs wth processng tme p j = δ(1 + δ) j for j = 0,..., R (where δ(1 + δ) R c mn (B 0 ) s the largest nonhuge processng tme). Accordng to Lemma 2.1 R = O(1/δ log(c mn (B 0 )/δc mn (B 0 )) = O(1/δ log(1/δ)). Fnally, we use a varable y j,l to ndcate the fractonal number of jobs of sze δ p j < δ c(l) paced as a small job n B l. For a job sze wth p j δ c(l) (that s large wth respect to B l ) we set y j,l = 0. For jobs wth p j (c max (B 1 ), c mn (B 0 )) we have y j,0 = n j. Furthermore, we may suppose that y j,0 = 0 for jobs wth processng tme at For smplcty we use B 0 = B 0. In the LP below we use a varable x (l) least δc mn (B 0 ). Ths means that the large jobs for B 0 are placed nto B 0 only n the preprocessng step. Ths assumpton s useful for the roundng of the LP. LP(B 1 ) : x(l) m l for l = 1,..., N l, a(j, (l) )x (l) + l y j,l = n j for j = 0,..., R sze(c(l) )x (l) + j y j,lδ(1 + δ) j m l c(l) for l = 1,..., N R j=1 y j,0δ(1 + δ) j S 0 15
16 x (l) 0 for l = 1,..., L and = 1,..., h l y j,l 0 for j = 0,..., R and l = 0,..., N As n [12] the coeffcents n the last N + 1 constrants of the LP can be rounded and each nequalty can be transformed so that the converted coeffcents are bounded by O(n/δ). The facet complexty of the polyhedron correspondng to the resultng dual lnear program s bounded by (O(R log(n) + n log(n/δ))) = O(n log(n/δ)). The encodng length of the vector of the objectve functon of the dual s bounded by poly(n, 1/δ). Thus, accordng to [7] we acheve a basc optmum soluton of LP(B 1 ) n tme poly(n, 1/δ). New roundng technque. We descrbe here a new approach to round the soluton of the LP usng a subroutne for bn pacng wth dfferent bn szes. Actually, we could also use another roundng method as n [12]. But t requres the gap g(1/δ) to be much larger: In order to bound the addtonal O(1/δ 2 log(1/δ)) bns of sze c max (B 1 ) by the term δc max (B 0 ), the gap g(1/δ) should be at least Ω(1/δ 3 log(1/δ)). So recall the condtons of Case 2, that means that there exsts an ndex K+1 f( 1 /δ) = O(C(Ãδ)) wth c 1 / c < g( 1 /δ) for 1 K wth g(1/δ) 1/δ log 2 (1/δ) and c 1 / c g( 1 /δ) for K + 1 m. In our new approach we subdvde B 1 nto groups of bns D 1,..., D H wth smlar bn szes. These groups are not necessary equal to the groups B 1,..., B N we consdered to set up the above LP-relaxaton. Then we use the soluton of the LP relaxaton above to pac the jobs or tems va a bn pacng algorthm. For each group D the bn pacng algorthm pacs the selected tems nto the group D of bns wth dfferent bn szes plus few addtonal bns of maxmum capacty c max (D ). Based on the subdvson the number of large tem szes can be bounded by d = O(1/δ log(1/δ)) for each group D. Usng a recent result [13], we are able to pac the selected tems nto D plus O(log 2 (d)) = O(log 2 (1/δ)) bns of capacty c max (D ). The overall goal s to obtan a pacng of almost all jobs nto B 1 plus at most O(log 2 (1/δ)) bns of capacty c max (B 1 ). Fnally we use the gap g(1/δ) to move the jobs whch le n the addtonal bns onto the faster machnes wth slghtly ncreased maespan. In the followng we explan n detal how ths roundng wors. c 1 < c max (B 1 )/h(1/δ) c 2 < c max (D 2 )/h(1/δ) b K+1 b 1 1 b 1 b 2 1 b 2 b H 1 m D 1 D 2 D H Fgure 3: Groupng B 1 nto D 1 to D H Suppose that B 1 has a bn b 1 wth c 1 < c max (B 1 )/h(1/δ), where h : IR + IR + s a functon wth poly(1/δ) h(1/δ) 1/δ. W.l.o.g. let 1 {K+1,..., m} be mnmal wth that property. In ths case we buld D 1 = {b K+1,..., b 1 1} and construct the other groups D 2,..., D H teratvely n the same way. The next group D 2 = {b 1,..., b 2 1} fulflls the 16
17 propertes c mn (D 2 ) = c 2 1 c max (D 2 )/h(1/δ) and c 2 < c max (D 2 )/h(1/δ), see Fgure 3. If all bns have capacty larger than or equal c max (B 1 )/h(1/δ), we have only one group D 1 = {b K+1,..., b m }. Furthermore, f bn b j D has capacty c l for l {1,..., N} we have B l D. Wth Lemma 2.1 we conclude that the number of dfferent bn szes n each group D s at most O(1/δ log(h(1/δ))) and the number of large job szes n D s at most O(1/δ log(h(1/δ)/δ)). Snce h(1/δ) poly(1/δ), both numbers are bounded by O(1/δ log(1/δ)). Consder now a lnear program soluton (x (l), y j,l ) and consder the reduced lnear program LP wth correspondng constrants for the bn group D. LP : x(l) = m l for bns n capacty c(l) n D l, a(j, (l) )x (l) n () j for each large job sze n D x (l) 0 for l = 1,..., L, The value m l m l s the fractonal number of bns of sze c(l) n D and n () j s the fractonal number of large job szes δ(1 + δ) j placed nto D accordng to the soluton of LP(B 1 ). A job sze p j s large n D f p j = δ(1 + δ) j [δ c(l), c(l)] for at least one bn group B l n D wth capacty c(l). If n LP we replace the rght hand sdes n () j by n () j for each large job sze, we have to cover an ntegral number of jobs per large job sze. Thus, the total executon tme p j large n D δ(1 + δ) j of the non-covered large jobs n D can be bounded by c max (D ) j=0 (1 + δ) j = c max (D )(1 + δ)/δ (usng the geometrc sum over the job szes). The analyss for the frst bloc D 1 wth bound c max (D 1 )(1 + δ)/δ for the non-covered jobs above can be even further mproved: Lemma 3.4. If we replace n (1) j by n (1) j n LP, the total processng tme of the noncovered large jobs n D 1 s bounded by (1 + δ) mn{c mn (B 0 ), cmax(d 1)/δ}. Proof. All jobs wth processng tme p j (c max (D 2 ), δc mn (B 0 )) are large or small correspondng to bns n D 1, but small correspondng to B 0. Notce, that jobs wth p j [δc mn (B 0 ), c max (D 1 )] are large correspondng to B 0 and chosen va the preprocessng step above. Ths mples that we may assume y j,0 = 0 for the correspondng values. Snce c mn (B 0 ) > c max (D 1 ) and c max (D 1 )/c max (D 2 ) > h(1/δ) 1/δ, we have c max (D 2 ) < δc max (D 1 ) < δc mn (B 0 ). Therefore, a job wth p j [δc mn (B 0 ), c max (D 1 )] does not ft nto D 2. Moreover, we can assume that the values n (1) j are ntegral. Snce the values n (1) j are ntegral for processng tmes p j [δc mn (B 0 ), c max (D 1 )], the not covered large jobs have processng tmes δc mn (B 0 ). Consequently, the total sum of the executon tmes of the large jobs not covered by the bn pacng subroutne n D 1 s bounded by mn{(1 + δ)c mn (B 0 ), c max (D 1 )(1 + δ)/δ} (as above usng the geometrc sum argument appled to δc mn (B 0 ) nstead of c max (D )). Now a (fractonal) soluton of the modfed LP can be transformed nto an ntegral soluton. That means n () j jobs of sze δ(1 + δ) j can be paced nto the bns n D plus O(log 2 (d)) addtonal bns of sze c max (D ) [13] (where d = O(1/δ log(1/δ)) s the number of dfferent large job szes). Notce that t s allowed to use m l bns nstead of the 17
18 fractonal number m l of bns n each group B l. Ths s suffcent, snce the overall area l:b l D Area(large, l) of the large jobs paced nto D plus the extra bns remans the same. The (y j,l ) varables can be rounded as before [12] usng a result of Lenstra et al. [17], but here we have to round up (nstead of down) the values N j, the number of jobs of sze δ(1 + δ) j assgned as a small job to the blocs B l for all job szes j. Almost all correspondng small jobs can be paced drectly nto B 1. For each bloc B l there s at most one fractonal varable ỹ j,l and a correspondng small job that does not ft completely n B l. But ths job can be paced nto one bn of B l, f we ncrease the correspondng bn sze slghtly. Lemma 3.5. The total executon tme of the jobs n the addtonal bns for D 1,..., D H s at most (1 + δ) mn{c mn (B 0 ), (1/δ)c max (D 1 )} + O(log 2 (1/δ))c max (D 1 ). Proof. The total executon tme of all jobs n the addtonal bns for D s at most [ 1 + δ δ + O(log 2 (1/δ))]c max (D ) C δ c max(d ) where C s a constant. Usng h(1/δ)c max (D +1 ) c max (D ) ths mples the followng bound for the extra executon tme n D 2,..., D H C 2 c δ max(d ) C δ c max(d 2 ) 0 h(1/δ) h(1/δ) 1/δ C δ c max(d 2 ) 0 δ δ 1/2 2C δ c max(d 2 ) O(1)c max (D 1 ). Wth Lemma 3.4 the total extra executon tme among the bn groups D 1,..., D H s at most (1 + δ) mn{c mn (B 0 ), (1/δ)c max (D 1 )} + O(log 2 (1/δ))c max (D 1 ) + O(1)c max (D 1 ). Notce that all jobs nvolved n the frst term are small correspondng to B 0 (.e. p j δc mn (B 0 )). The other jobs that contrbute to O(log 2 (1/δ))c max (D 1 ) could be large correspondng to B 0, but have processng tme p j c max (D 1 ) = c max (B 1 ). We can now dstrbute the jobs correspondng to the addtonal term among the bns of B 0. We proceed by case dstncton. Case 2.1: K (1 + δ)/δ. In ths case the addtonal term (1 + δ)c mn (B 0 ) wth small jobs of sze at most δc mn (B 0 ) can be dstrbuted onto the frst (1 + δ)/δ bns wth addtonal load 2δc mn (B 0 ). Here smply use a greedy algorthm that dstrbutes a load of at least δc mn (B 0 ) and at most 2δc mn (B 0 ) (f possble) on the frst bns. The last bn gets load at most δc mn (B 0 ). The number of bns needed s at most (1 + δ)/δ K. Ths mples that the frst K bns get load at most c + 2δc mn (B 0 ) (1 + 2δ) c. Ths mples the followng result Lemma 3.6. Let b K+1 be the frst bn such that c 1 / c K+1 g(1/δ) and K (1 + δ)/δ, then we can compute an approxmate schedule of length (1 + O(δ))OP T (I) n tme 2 O(1/δ log(1/δ) log(c(ãδ)/δ)) poly(1/δ, n). 18
19 Proof. Snce g(1/δ) 1/δ log 2 (1/δ) and c 1 c K+1 g(1/δ) we can schedule the remanng jobs of length p j c max (B 1 ) wth total executon tme O(log 2 (1/δ))c max (D 1 ) nto B 0 n the frst largest bn: We have log 2 (1/δ)c max (B 1 ) log2 (1/δ) c g(1/δ) max (B 0 ) O(δ)c max (B 0 ). Case 2.2: c max (B 0 )/c max (B 1 ) 1/δ 2. In ths case the addtonal processng tme s bounded by ((1 + δ)/δ)c max (D 1 ) + O(log 2 (1/δ))c max (D 1 ) O(1/δ)c max (D 1 ) O(δ)c max (B 0 ). Ths amount can be paced onto the largest bn by ncreasng ts bn sze to (1 + O(δ))c max (B 0 ). We summarze Lemma 3.7. Let g(1/δ) 1/δ 2, then we can compute an approxmate schedule of length (1 + O(δ))OP T (I) n tme 2 O(1/δ log(1/δ) log(c(ãδ)/δ)) poly(1/δ, n). Case 2.3: K < (1 + δ)/δ and c max (B 0 )/c max (B 1 ) < 1/δ 2. Notce that we can also use our general assumpton on g(1/δ). Ths mples that c 1 / c K+1 1/δ log 2 (1/δ). Here let us consder jobs wth processng tme p j n the nterval I = [δc max (D 1 ), mn{δc mn (B 0 ), c max (D 1 )}] and denote wth P cr = { p j I} the processng tmes of those crtcal jobs. Snce max(p cr )/ mn(p cr ) 1/δ, there are at most O(1/δ log(1/δ)) dfferent rounded processng tmes for the crtcal jobs. Furthermore, the total number of crtcal jobs that can be paced nto B 0 s at most Kc max (B 0 )/(δc max (D 1 )) O(1/δ 2 )c max (B 0 )/c max (D 1 ) O(1/δ 4 ) under the second assumpton above. The crtcal jobs can be chosen for B 0 and paced nto the bns n B 0 durng our preprocessng step. For g(1/δ) = O(1/δ log 2 (1/δ)), the large and crtcal jobs can be selected and pre-paced nto B 0 n tme (1/δ 4 O(1/δ log(1/δ)) ) 2 O(1/δ log2 (1/δ)). For each correspondng feasble vector v we set up a lnear program, round the soluton and place the correspondng large jobs nto the bns plus few addtonal bns of sze O(log 2 (1/δ))c max (D 1 ) O(log 2 (1/δ))c max B 0 /g(1/δ) O(δ)c max (B 0 ). In ths case, for all crtcal jobs wth p j P cr we may suppose that y j,0 = 0 (no further such jobs are paced nto B 0 va the LP). Ths mples that the correspondng values n (1) j are ntegral. Here agan we use the fact that a large job n D 1 wth p j δc max (D 1 ) > c max (D 2 ) does not ft nto bn group D 2. In ths case the term for the non-covered jobs n D 1 can be bounded by (1 + δ)c max (D 1 ) δc max (B 0 ). Furthermore, note that for K = O(1/δ), the runnng tme of our algorthm s bounded by 2 O(1/δ log2 (1/δ)) poly(1/δ, n) (compare to Secton 3.2). Ths gves Lemma 3.8. Let b K+1 be the frst bn such that c 1 / c K+1 Ω(1/δ log 2 (1/δ)), K < (1 + δ)/δ and c 1 / c K+1 < 1/δ 2, then we can compute an approxmate schedule of length (1 + O(δ))OP T (I) n tme 2 O(1/δ log2 (1/δ)) poly(1/δ, n). The analyss of all three subcase mples the followng result. Theorem 3.9. In each subcase of case 2 the algorthm produces a schedule of length (1 + O(δ))OP T (I) n tme 2 O(1/δ log(1/δ) log(c(ãδ)) poly(1/δ, n). 19
20 3.3 Algorthm for Case 3 In ths case we have two or three bn groups dependng on the shape of bn szes as depcted n Fgure 4. Let B 0 = {b 1,..., b K } be the set of the largest bns. Then, we defne B 1 = {b > K, c δc mn (B 0 )} and B 2 = B \ (B 0 B 1 ) as the remanng bns. If B 1 we dstngush large, medum and small jobs. A job s called large f p j > δc mn (B 0 ) and medum f p j (δc mn (B 1 ), δc mn (B 0 )]; other jobs are called small. Note that for a medum job we have p j δc mn (B 0 ) c max (B 1 ) by constructon. If B 1 = we do not have medum jobs. In ths case we have for all > K that c δc mn (B 0 ). Thus, we have an addtonal c gap between c K and c K+1,.e. K c K+1 = c mn(b 0 ) > c mn(b 0 ) = 1. c max(b 1 ) δc mn (B 0 ) δ < g(1/δ) g(1/δ) δc max (B 0 ) 1 2 K K + 1 m B 0 B 1 B 2 Fgure 4: Shape of bns for case 3 Lemma 2.1 mples that the number of dfferent rounded bn szes and large and medum job szes correspondng to B 0 B 1 s bounded by O(1/δ log(g(1/δ)/δ)) and O(1/δ log(g(1/δ)/δ 2 )), respectvely. Notce that both numbers are at most O(1/δ log(1/δ)) snce g(1/δ) = poly(1/δ). Now we dvde the set B = B 0 B 1 B 2 nto N groups B l wth m l bns wth the same rounded bn sze c(l) for l = 1,..., N and set up a lnear program. Later we consder a reduced LP for the frst two bn groups separately. In the LP below we use a varable x (l) to ndcate the fractonal length of a multset C (l) of large processng tmes p j [δ c(l), c(l)] paced nto bns of sze c(l). Let a(j, (l) ) be the number of the occurrences of p j n C (l) and let sze(c (l) ) = j a(j, (l) ) p j. Furthermore, let n j be the number of jobs wth processng tme p j = δ(1 + δ) j for j = 0,..., R (where δ(1 + δ) R s the largest jobs sze). Fnally, we use a varable y j,l to ndcate the fractonal number of jobs of sze δ p j < δ c(l) paced as a small job n B l. x(l) m l for l = 1,..., N l, a(j, (l) )x (l) + l y j,l = n j for j = 0,..., R sze(c(l) )x (l) + j y j,lδ(1 + δ) j m l c(l) for l = 1,..., N x (l) 0 for l = 1,..., N and = 1,..., h l y j,l 0 for j = 0,..., R and l = 1,..., N We suppose that all jobs ft nto the bns,.e. δ(1 + δ) R c max (B 0 ); otherwse there s no schedule wth the correspondng maespan n the bnary search. Suppose that B 0 conssts of L bn groups B l and B 1 conssts of P bn groups, see also Fg
21 δc mn(b 0) 1... m m L B m L m L+P B 1 Fgure 5: Groups of smlar capactes n B 0 B 1 Allocatng large jobs nto B 0 and B 1. Suppose that the entre LP and the correspondng ILP have a soluton. Consder now the correspondng (x (l) ) varables and constrants for the frst L + P bn groups. Let δ(1 + δ) Rm be the smallest medum job sze and let δ(1 + δ) R l be the smallest large job sze. x(l) m l m l for l = 1,..., L + P l, a(j, (l) )x (l) n j for j = R m,..., R x (l) 0 for l = 1,..., L + P and = 1,..., h l For a large job sze we have p j > δc mn (B 0 ) > c max (B 2 ). Hence, the large jobs have to be scheduled n B 0 B 1. Consequently, we descrbe them by confguraton varables only n the orgnal LP and so the number n j for large jobs covered by the LP above s ntegral and satsfes n j = n j. For medum job szes, there are y j,l varables n the ntal LP and we have n general fractonal varables n j n j. Note that a confguraton C (l) szes by constructon and a confguraton C (l) job szes. C (l) n B 0 contans only large job n B 1 may contan both, large and medum Let be a confguraton wth only large job szes n bn group B l n B 1 and let z (l) (l) (l) be a varable that ndcates the total length of C. For the rest of the paper we call C a bg confguraton. Then, the orgnal confguratons wth both, medum and large job szes, can be parttoned nto groups wth the same arrangement of large jobs accordng (l) to confguraton C (contanng only large jobs). Let Index(, l) be the set of all ndces such that C (l) (l) concdes wth C for the large job szes. Then, z (l) = Index(,l) x(l) and the followng modfed LP for the large job szes has a feasble soluton. LP large x(l) m l for l = 1,..., L z(l) m l for l = L + 1,..., L + P l, a(j, (l) )x (l) + l, a(j, (l) )z (l) n j for j = R l,..., R x (l) 0 for l = 1,..., L + P and = 1,..., h l Snce all large job szes have to be placed nto the frst L + P bn groups and usng the assumpton that the entre ILP has a soluton, the modfed ILP for the large job szes has a feasble soluton, too. Usng the Theorem by Coo et al. [3], there s an ILP 21
The Greedy Method. Introduction. 0/1 Knapsack Problem
The Greedy Method Introducton We have completed data structures. We now are gong to look at algorthm desgn methods. Often we are lookng at optmzaton problems whose performance s exponental. For an optmzaton
More informationLuby s Alg. for Maximal Independent Sets using Pairwise Independence
Lecture Notes for Randomzed Algorthms Luby s Alg. for Maxmal Independent Sets usng Parwse Independence Last Updated by Erc Vgoda on February, 006 8. Maxmal Independent Sets For a graph G = (V, E), an ndependent
More information8.5 UNITARY AND HERMITIAN MATRICES. The conjugate transpose of a complex matrix A, denoted by A*, is given by
6 CHAPTER 8 COMPLEX VECTOR SPACES 5. Fnd the kernel of the lnear transformaton gven n Exercse 5. In Exercses 55 and 56, fnd the mage of v, for the ndcated composton, where and are gven by the followng
More information1 Example 1: Axis-aligned rectangles
COS 511: Theoretcal Machne Learnng Lecturer: Rob Schapre Lecture # 6 Scrbe: Aaron Schld February 21, 2013 Last class, we dscussed an analogue for Occam s Razor for nfnte hypothess spaces that, n conjuncton
More informationbenefit is 2, paid if the policyholder dies within the year, and probability of death within the year is ).
REVIEW OF RISK MANAGEMENT CONCEPTS LOSS DISTRIBUTIONS AND INSURANCE Loss and nsurance: When someone s subject to the rsk of ncurrng a fnancal loss, the loss s generally modeled usng a random varable or
More informationRecurrence. 1 Definitions and main statements
Recurrence 1 Defntons and man statements Let X n, n = 0, 1, 2,... be a MC wth the state space S = (1, 2,...), transton probabltes p j = P {X n+1 = j X n = }, and the transton matrx P = (p j ),j S def.
More informationJ. Parallel Distrib. Comput.
J. Parallel Dstrb. Comput. 71 (2011) 62 76 Contents lsts avalable at ScenceDrect J. Parallel Dstrb. Comput. journal homepage: www.elsever.com/locate/jpdc Optmzng server placement n dstrbuted systems n
More information8 Algorithm for Binary Searching in Trees
8 Algorthm for Bnary Searchng n Trees In ths secton we present our algorthm for bnary searchng n trees. A crucal observaton employed by the algorthm s that ths problem can be effcently solved when the
More informationv a 1 b 1 i, a 2 b 2 i,..., a n b n i.
SECTION 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS 455 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS All the vector spaces we have studed thus far n the text are real vector spaces snce the scalars are
More informationDEFINING %COMPLETE IN MICROSOFT PROJECT
CelersSystems DEFINING %COMPLETE IN MICROSOFT PROJECT PREPARED BY James E Aksel, PMP, PMI-SP, MVP For Addtonal Informaton about Earned Value Management Systems and reportng, please contact: CelersSystems,
More informationAn MILP model for planning of batch plants operating in a campaign-mode
An MILP model for plannng of batch plants operatng n a campagn-mode Yanna Fumero Insttuto de Desarrollo y Dseño CONICET UTN yfumero@santafe-concet.gov.ar Gabrela Corsano Insttuto de Desarrollo y Dseño
More informationModule 2 LOSSLESS IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur
Module LOSSLESS IMAGE COMPRESSION SYSTEMS Lesson 3 Lossless Compresson: Huffman Codng Instructonal Objectves At the end of ths lesson, the students should be able to:. Defne and measure source entropy..
More informationJoint Scheduling of Processing and Shuffle Phases in MapReduce Systems
Jont Schedulng of Processng and Shuffle Phases n MapReduce Systems Fangfe Chen, Mural Kodalam, T. V. Lakshman Department of Computer Scence and Engneerng, The Penn State Unversty Bell Laboratores, Alcatel-Lucent
More information2008/8. An integrated model for warehouse and inventory planning. Géraldine Strack and Yves Pochet
2008/8 An ntegrated model for warehouse and nventory plannng Géraldne Strack and Yves Pochet CORE Voe du Roman Pays 34 B-1348 Louvan-la-Neuve, Belgum. Tel (32 10) 47 43 04 Fax (32 10) 47 43 01 E-mal: corestat-lbrary@uclouvan.be
More informationSupport Vector Machines
Support Vector Machnes Max Wellng Department of Computer Scence Unversty of Toronto 10 Kng s College Road Toronto, M5S 3G5 Canada wellng@cs.toronto.edu Abstract Ths s a note to explan support vector machnes.
More informationHow To Solve A Problem In A Powerline (Powerline) With A Powerbook (Powerbook)
MIT 8.996: Topc n TCS: Internet Research Problems Sprng 2002 Lecture 7 March 20, 2002 Lecturer: Bran Dean Global Load Balancng Scrbe: John Kogel, Ben Leong In today s lecture, we dscuss global load balancng
More informationProject Networks With Mixed-Time Constraints
Project Networs Wth Mxed-Tme Constrants L Caccetta and B Wattananon Western Australan Centre of Excellence n Industral Optmsaton (WACEIO) Curtn Unversty of Technology GPO Box U1987 Perth Western Australa
More information) of the Cell class is created containing information about events associated with the cell. Events are added to the Cell instance
Calbraton Method Instances of the Cell class (one nstance for each FMS cell) contan ADC raw data and methods assocated wth each partcular FMS cell. The calbraton method ncludes event selecton (Class Cell
More informationWhat is Candidate Sampling
What s Canddate Samplng Say we have a multclass or mult label problem where each tranng example ( x, T ) conssts of a context x a small (mult)set of target classes T out of a large unverse L of possble
More informationHow To Calculate An Approxmaton Factor Of 1 1/E
Approxmaton algorthms for allocaton problems: Improvng the factor of 1 1/e Urel Fege Mcrosoft Research Redmond, WA 98052 urfege@mcrosoft.com Jan Vondrák Prnceton Unversty Prnceton, NJ 08540 jvondrak@gmal.com
More informationPower-of-Two Policies for Single- Warehouse Multi-Retailer Inventory Systems with Order Frequency Discounts
Power-of-wo Polces for Sngle- Warehouse Mult-Retaler Inventory Systems wth Order Frequency Dscounts José A. Ventura Pennsylvana State Unversty (USA) Yale. Herer echnon Israel Insttute of echnology (Israel)
More informationFeature selection for intrusion detection. Slobodan Petrović NISlab, Gjøvik University College
Feature selecton for ntruson detecton Slobodan Petrovć NISlab, Gjøvk Unversty College Contents The feature selecton problem Intruson detecton Traffc features relevant for IDS The CFS measure The mrmr measure
More informationMultiplication Algorithms for Radix-2 RN-Codings and Two s Complement Numbers
Multplcaton Algorthms for Radx- RN-Codngs and Two s Complement Numbers Jean-Luc Beuchat Projet Arénare, LIP, ENS Lyon 46, Allée d Itale F 69364 Lyon Cedex 07 jean-luc.beuchat@ens-lyon.fr Jean-Mchel Muller
More informationLoop Parallelization
- - Loop Parallelzaton C-52 Complaton steps: nested loops operatng on arrays, sequentell executon of teraton space DECLARE B[..,..+] FOR I :=.. FOR J :=.. I B[I,J] := B[I-,J]+B[I-,J-] ED FOR ED FOR analyze
More informationAdaptive Fractal Image Coding in the Frequency Domain
PROCEEDINGS OF INTERNATIONAL WORKSHOP ON IMAGE PROCESSING: THEORY, METHODOLOGY, SYSTEMS AND APPLICATIONS 2-22 JUNE,1994 BUDAPEST,HUNGARY Adaptve Fractal Image Codng n the Frequency Doman K AI UWE BARTHEL
More informationTo Fill or not to Fill: The Gas Station Problem
To Fll or not to Fll: The Gas Staton Problem Samr Khuller Azarakhsh Malekan Julán Mestre Abstract In ths paper we study several routng problems that generalze shortest paths and the Travelng Salesman Problem.
More informationSngle Snk Buy at Bulk Problem and the Access Network
A Constant Factor Approxmaton for the Sngle Snk Edge Installaton Problem Sudpto Guha Adam Meyerson Kamesh Munagala Abstract We present the frst constant approxmaton to the sngle snk buy-at-bulk network
More informationBERNSTEIN POLYNOMIALS
On-Lne Geometrc Modelng Notes BERNSTEIN POLYNOMIALS Kenneth I. Joy Vsualzaton and Graphcs Research Group Department of Computer Scence Unversty of Calforna, Davs Overvew Polynomals are ncredbly useful
More informationInstitute of Informatics, Faculty of Business and Management, Brno University of Technology,Czech Republic
Lagrange Multplers as Quanttatve Indcators n Economcs Ivan Mezník Insttute of Informatcs, Faculty of Busness and Management, Brno Unversty of TechnologCzech Republc Abstract The quanttatve role of Lagrange
More informationChapter 4 ECONOMIC DISPATCH AND UNIT COMMITMENT
Chapter 4 ECOOMIC DISATCH AD UIT COMMITMET ITRODUCTIO A power system has several power plants. Each power plant has several generatng unts. At any pont of tme, the total load n the system s met by the
More informationEnabling P2P One-view Multi-party Video Conferencing
Enablng P2P One-vew Mult-party Vdeo Conferencng Yongxang Zhao, Yong Lu, Changja Chen, and JanYn Zhang Abstract Mult-Party Vdeo Conferencng (MPVC) facltates realtme group nteracton between users. Whle P2P
More informationForecasting the Direction and Strength of Stock Market Movement
Forecastng the Drecton and Strength of Stock Market Movement Jngwe Chen Mng Chen Nan Ye cjngwe@stanford.edu mchen5@stanford.edu nanye@stanford.edu Abstract - Stock market s one of the most complcated systems
More informationLogical Development Of Vogel s Approximation Method (LD-VAM): An Approach To Find Basic Feasible Solution Of Transportation Problem
INTERNATIONAL JOURNAL OF SCIENTIFIC & TECHNOLOGY RESEARCH VOLUME, ISSUE, FEBRUARY ISSN 77-866 Logcal Development Of Vogel s Approxmaton Method (LD- An Approach To Fnd Basc Feasble Soluton Of Transportaton
More informationHow Sets of Coherent Probabilities May Serve as Models for Degrees of Incoherence
1 st Internatonal Symposum on Imprecse Probabltes and Ther Applcatons, Ghent, Belgum, 29 June 2 July 1999 How Sets of Coherent Probabltes May Serve as Models for Degrees of Incoherence Mar J. Schervsh
More informationAvailability-Based Path Selection and Network Vulnerability Assessment
Avalablty-Based Path Selecton and Network Vulnerablty Assessment Song Yang, Stojan Trajanovsk and Fernando A. Kupers Delft Unversty of Technology, The Netherlands {S.Yang, S.Trajanovsk, F.A.Kupers}@tudelft.nl
More informationMinimal Coding Network With Combinatorial Structure For Instantaneous Recovery From Edge Failures
Mnmal Codng Network Wth Combnatoral Structure For Instantaneous Recovery From Edge Falures Ashly Joseph 1, Mr.M.Sadsh Sendl 2, Dr.S.Karthk 3 1 Fnal Year ME CSE Student Department of Computer Scence Engneerng
More informationMulti-Resource Fair Allocation in Heterogeneous Cloud Computing Systems
1 Mult-Resource Far Allocaton n Heterogeneous Cloud Computng Systems We Wang, Student Member, IEEE, Ben Lang, Senor Member, IEEE, Baochun L, Senor Member, IEEE Abstract We study the mult-resource allocaton
More informationExtending Probabilistic Dynamic Epistemic Logic
Extendng Probablstc Dynamc Epstemc Logc Joshua Sack May 29, 2008 Probablty Space Defnton A probablty space s a tuple (S, A, µ), where 1 S s a set called the sample space. 2 A P(S) s a σ-algebra: a set
More informationOn the Interaction between Load Balancing and Speed Scaling
On the Interacton between Load Balancng and Speed Scalng Ljun Chen and Na L Abstract Speed scalng has been wdely adopted n computer and communcaton systems, n partcular, to reduce energy consumpton. An
More informationRate Monotonic (RM) Disadvantages of cyclic. TDDB47 Real Time Systems. Lecture 2: RM & EDF. Priority-based scheduling. States of a process
Dsadvantages of cyclc TDDB47 Real Tme Systems Manual scheduler constructon Cannot deal wth any runtme changes What happens f we add a task to the set? Real-Tme Systems Laboratory Department of Computer
More informationPeriod and Deadline Selection for Schedulability in Real-Time Systems
Perod and Deadlne Selecton for Schedulablty n Real-Tme Systems Thdapat Chantem, Xaofeng Wang, M.D. Lemmon, and X. Sharon Hu Department of Computer Scence and Engneerng, Department of Electrcal Engneerng
More informationVirtual Network Embedding with Coordinated Node and Link Mapping
Vrtual Network Embeddng wth Coordnated Node and Lnk Mappng N. M. Mosharaf Kabr Chowdhury Cherton School of Computer Scence Unversty of Waterloo Waterloo, Canada Emal: nmmkchow@uwaterloo.ca Muntasr Rahan
More informationOn the Interaction between Load Balancing and Speed Scaling
On the Interacton between Load Balancng and Speed Scalng Ljun Chen, Na L and Steven H. Low Engneerng & Appled Scence Dvson, Calforna Insttute of Technology, USA Abstract Speed scalng has been wdely adopted
More informationSurvey on Virtual Machine Placement Techniques in Cloud Computing Environment
Survey on Vrtual Machne Placement Technques n Cloud Computng Envronment Rajeev Kumar Gupta and R. K. Paterya Department of Computer Scence & Engneerng, MANIT, Bhopal, Inda ABSTRACT In tradtonal data center
More informationEfficient Project Portfolio as a tool for Enterprise Risk Management
Effcent Proect Portfolo as a tool for Enterprse Rsk Management Valentn O. Nkonov Ural State Techncal Unversty Growth Traectory Consultng Company January 5, 27 Effcent Proect Portfolo as a tool for Enterprse
More informationOn the Optimal Control of a Cascade of Hydro-Electric Power Stations
On the Optmal Control of a Cascade of Hydro-Electrc Power Statons M.C.M. Guedes a, A.F. Rbero a, G.V. Smrnov b and S. Vlela c a Department of Mathematcs, School of Scences, Unversty of Porto, Portugal;
More information行 政 院 國 家 科 學 委 員 會 補 助 專 題 研 究 計 畫 成 果 報 告 期 中 進 度 報 告
行 政 院 國 家 科 學 委 員 會 補 助 專 題 研 究 計 畫 成 果 報 告 期 中 進 度 報 告 畫 類 別 : 個 別 型 計 畫 半 導 體 產 業 大 型 廠 房 之 設 施 規 劃 計 畫 編 號 :NSC 96-2628-E-009-026-MY3 執 行 期 間 : 2007 年 8 月 1 日 至 2010 年 7 月 31 日 計 畫 主 持 人 : 巫 木 誠 共 同
More informationResearch Article Enhanced Two-Step Method via Relaxed Order of α-satisfactory Degrees for Fuzzy Multiobjective Optimization
Hndaw Publshng Corporaton Mathematcal Problems n Engneerng Artcle ID 867836 pages http://dxdoorg/055/204/867836 Research Artcle Enhanced Two-Step Method va Relaxed Order of α-satsfactory Degrees for Fuzzy
More informationA DYNAMIC CRASHING METHOD FOR PROJECT MANAGEMENT USING SIMULATION-BASED OPTIMIZATION. Michael E. Kuhl Radhamés A. Tolentino-Peña
Proceedngs of the 2008 Wnter Smulaton Conference S. J. Mason, R. R. Hll, L. Mönch, O. Rose, T. Jefferson, J. W. Fowler eds. A DYNAMIC CRASHING METHOD FOR PROJECT MANAGEMENT USING SIMULATION-BASED OPTIMIZATION
More informationThe Development of Web Log Mining Based on Improve-K-Means Clustering Analysis
The Development of Web Log Mnng Based on Improve-K-Means Clusterng Analyss TngZhong Wang * College of Informaton Technology, Luoyang Normal Unversty, Luoyang, 471022, Chna wangtngzhong2@sna.cn Abstract.
More informationAn Enhanced Super-Resolution System with Improved Image Registration, Automatic Image Selection, and Image Enhancement
An Enhanced Super-Resoluton System wth Improved Image Regstraton, Automatc Image Selecton, and Image Enhancement Yu-Chuan Kuo ( ), Chen-Yu Chen ( ), and Chou-Shann Fuh ( ) Department of Computer Scence
More informationTraffic State Estimation in the Traffic Management Center of Berlin
Traffc State Estmaton n the Traffc Management Center of Berln Authors: Peter Vortsch, PTV AG, Stumpfstrasse, D-763 Karlsruhe, Germany phone ++49/72/965/35, emal peter.vortsch@ptv.de Peter Möhl, PTV AG,
More informationExamensarbete. Rotating Workforce Scheduling. Caroline Granfeldt
Examensarbete Rotatng Workforce Schedulng Carolne Granfeldt LTH - MAT - EX - - 2015 / 08 - - SE Rotatng Workforce Schedulng Optmerngslära, Lnköpngs Unverstet Carolne Granfeldt LTH - MAT - EX - - 2015
More informationA hybrid global optimization algorithm based on parallel chaos optimization and outlook algorithm
Avalable onlne www.ocpr.com Journal of Chemcal and Pharmaceutcal Research, 2014, 6(7):1884-1889 Research Artcle ISSN : 0975-7384 CODEN(USA) : JCPRC5 A hybrd global optmzaton algorthm based on parallel
More informationThe Geometry of Online Packing Linear Programs
The Geometry of Onlne Packng Lnear Programs Marco Molnaro R. Rav Abstract We consder packng lnear programs wth m rows where all constrant coeffcents are n the unt nterval. In the onlne model, we know the
More informationEnergy Efficient Routing in Ad Hoc Disaster Recovery Networks
Energy Effcent Routng n Ad Hoc Dsaster Recovery Networks Gl Zussman and Adran Segall Department of Electrcal Engneerng Technon Israel Insttute of Technology Hafa 32000, Israel {glz@tx, segall@ee}.technon.ac.l
More informationSimulation and optimization of supply chains: alternative or complementary approaches?
Smulaton and optmzaton of supply chans: alternatve or complementary approaches? Chrstan Almeder Margaretha Preusser Rchard F. Hartl Orgnally publshed n: OR Spectrum (2009) 31:95 119 DOI 10.1007/s00291-007-0118-z
More informationPOLYSA: A Polynomial Algorithm for Non-binary Constraint Satisfaction Problems with and
POLYSA: A Polynomal Algorthm for Non-bnary Constrant Satsfacton Problems wth and Mguel A. Saldo, Federco Barber Dpto. Sstemas Informátcos y Computacón Unversdad Poltécnca de Valenca, Camno de Vera s/n
More informationLevel Annuities with Payments Less Frequent than Each Interest Period
Level Annutes wth Payments Less Frequent than Each Interest Perod 1 Annuty-mmedate 2 Annuty-due Level Annutes wth Payments Less Frequent than Each Interest Perod 1 Annuty-mmedate 2 Annuty-due Symoblc approach
More informationReal-Time Process Scheduling
Real-Tme Process Schedulng ktw@cse.ntu.edu.tw (Real-Tme and Embedded Systems Laboratory) Independent Process Schedulng Processes share nothng but CPU Papers for dscussons: C.L. Lu and James. W. Layland,
More informationA Simple Approach to Clustering in Excel
A Smple Approach to Clusterng n Excel Aravnd H Center for Computatonal Engneerng and Networng Amrta Vshwa Vdyapeetham, Combatore, Inda C Rajgopal Center for Computatonal Engneerng and Networng Amrta Vshwa
More informationHow To Solve An Onlne Control Polcy On A Vrtualzed Data Center
Dynamc Resource Allocaton and Power Management n Vrtualzed Data Centers Rahul Urgaonkar, Ulas C. Kozat, Ken Igarash, Mchael J. Neely urgaonka@usc.edu, {kozat, garash}@docomolabs-usa.com, mjneely@usc.edu
More informationWhen Network Effect Meets Congestion Effect: Leveraging Social Services for Wireless Services
When Network Effect Meets Congeston Effect: Leveragng Socal Servces for Wreless Servces aowen Gong School of Electrcal, Computer and Energy Engeerng Arzona State Unversty Tempe, AZ 8587, USA xgong9@asuedu
More informationGeneral Auction Mechanism for Search Advertising
General Aucton Mechansm for Search Advertsng Gagan Aggarwal S. Muthukrshnan Dávd Pál Martn Pál Keywords game theory, onlne auctons, stable matchngs ABSTRACT Internet search advertsng s often sold by an
More informationActivity Scheduling for Cost-Time Investment Optimization in Project Management
PROJECT MANAGEMENT 4 th Internatonal Conference on Industral Engneerng and Industral Management XIV Congreso de Ingenería de Organzacón Donosta- San Sebastán, September 8 th -10 th 010 Actvty Schedulng
More informationAnswer: A). There is a flatter IS curve in the high MPC economy. Original LM LM after increase in M. IS curve for low MPC economy
4.02 Quz Solutons Fall 2004 Multple-Choce Questons (30/00 ponts) Please, crcle the correct answer for each of the followng 0 multple-choce questons. For each queston, only one of the answers s correct.
More informationTHE DISTRIBUTION OF LOAN PORTFOLIO VALUE * Oldrich Alfons Vasicek
HE DISRIBUION OF LOAN PORFOLIO VALUE * Oldrch Alfons Vascek he amount of captal necessary to support a portfolo of debt securtes depends on the probablty dstrbuton of the portfolo loss. Consder a portfolo
More informationThis paper concerns the evaluation and analysis of order
ORDER-FULFILLMENT PERFORMANCE MEASURES IN AN ASSEMBLE- TO-ORDER SYSTEM WITH STOCHASTIC LEADTIMES JING-SHENG SONG Unversty of Calforna, Irvne, Calforna SUSAN H. XU Penn State Unversty, Unversty Park, Pennsylvana
More informationAn Interest-Oriented Network Evolution Mechanism for Online Communities
An Interest-Orented Network Evoluton Mechansm for Onlne Communtes Cahong Sun and Xaopng Yang School of Informaton, Renmn Unversty of Chna, Bejng 100872, P.R. Chna {chsun,yang}@ruc.edu.cn Abstract. Onlne
More informationSimple Interest Loans (Section 5.1) :
Chapter 5 Fnance The frst part of ths revew wll explan the dfferent nterest and nvestment equatons you learned n secton 5.1 through 5.4 of your textbook and go through several examples. The second part
More informationCompiling for Parallelism & Locality. Dependence Testing in General. Algorithms for Solving the Dependence Problem. Dependence Testing
Complng for Parallelsm & Localty Dependence Testng n General Assgnments Deadlne for proect 4 extended to Dec 1 Last tme Data dependences and loops Today Fnsh data dependence analyss for loops General code
More informationSoftware project management with GAs
Informaton Scences 177 (27) 238 241 www.elsever.com/locate/ns Software project management wth GAs Enrque Alba *, J. Francsco Chcano Unversty of Málaga, Grupo GISUM, Departamento de Lenguajes y Cencas de
More informationAn Alternative Way to Measure Private Equity Performance
An Alternatve Way to Measure Prvate Equty Performance Peter Todd Parlux Investment Technology LLC Summary Internal Rate of Return (IRR) s probably the most common way to measure the performance of prvate
More informationMulti-Source Video Multicast in Peer-to-Peer Networks
ult-source Vdeo ultcast n Peer-to-Peer Networks Francsco de Asís López-Fuentes*, Eckehard Stenbach Technsche Unverstät ünchen Insttute of Communcaton Networks, eda Technology Group 80333 ünchen, Germany
More informationLogistic Regression. Lecture 4: More classifiers and classes. Logistic regression. Adaboost. Optimization. Multiple class classification
Lecture 4: More classfers and classes C4B Machne Learnng Hlary 20 A. Zsserman Logstc regresson Loss functons revsted Adaboost Loss functons revsted Optmzaton Multple class classfcaton Logstc Regresson
More informationFinite Math Chapter 10: Study Guide and Solution to Problems
Fnte Math Chapter 10: Study Gude and Soluton to Problems Basc Formulas and Concepts 10.1 Interest Basc Concepts Interest A fee a bank pays you for money you depost nto a savngs account. Prncpal P The amount
More informationNON-CONSTANT SUM RED-AND-BLACK GAMES WITH BET-DEPENDENT WIN PROBABILITY FUNCTION LAURA PONTIGGIA, University of the Sciences in Philadelphia
To appear n Journal o Appled Probablty June 2007 O-COSTAT SUM RED-AD-BLACK GAMES WITH BET-DEPEDET WI PROBABILITY FUCTIO LAURA POTIGGIA, Unversty o the Scences n Phladelpha Abstract In ths paper we nvestgate
More informationEqulbra Exst and Trade S effcent proportionally
On Compettve Nonlnear Prcng Andrea Attar Thomas Marott Franços Salané February 27, 2013 Abstract A buyer of a dvsble good faces several dentcal sellers. The buyer s preferences are her prvate nformaton,
More informationProduction. 2. Y is closed A set is closed if it contains its boundary. We need this for the solution existence in the profit maximization problem.
Producer Theory Producton ASSUMPTION 2.1 Propertes of the Producton Set The producton set Y satsfes the followng propertes 1. Y s non-empty If Y s empty, we have nothng to talk about 2. Y s closed A set
More informationFault tolerance in cloud technologies presented as a service
Internatonal Scentfc Conference Computer Scence 2015 Pavel Dzhunev, PhD student Fault tolerance n cloud technologes presented as a servce INTRODUCTION Improvements n technques for vrtualzaton and performance
More informationPAS: A Packet Accounting System to Limit the Effects of DoS & DDoS. Debish Fesehaye & Klara Naherstedt University of Illinois-Urbana Champaign
PAS: A Packet Accountng System to Lmt the Effects of DoS & DDoS Debsh Fesehaye & Klara Naherstedt Unversty of Illnos-Urbana Champagn DoS and DDoS DDoS attacks are ncreasng threats to our dgtal world. Exstng
More informationOptimization of network mesh topologies and link capacities for congestion relief
Optmzaton of networ mesh topologes and ln capactes for congeston relef D. de Vllers * J.M. Hattngh School of Computer-, Statstcal- and Mathematcal Scences Potchefstroom Unversty for CHE * E-mal: rwddv@pu.ac.za
More informationOnline Auctions in IaaS Clouds: Welfare and Profit Maximization with Server Costs
Onlne Auctons n IaaS Clouds: Welfare and roft Maxmzaton wth Server Costs aox Zhang Dept. of Computer Scence The Unvety of Hong Kong xxzhang@cs.hku.hk Zongpeng L Dept. of Computer Scence Unvety of Calgary
More informationOnline Advertisement, Optimization and Stochastic Networks
Onlne Advertsement, Optmzaton and Stochastc Networks Bo (Rambo) Tan and R. Srkant Department of Electrcal and Computer Engneerng Unversty of Illnos at Urbana-Champagn Urbana, IL, USA 1 arxv:1009.0870v6
More informationLinear Circuits Analysis. Superposition, Thevenin /Norton Equivalent circuits
Lnear Crcuts Analyss. Superposton, Theenn /Norton Equalent crcuts So far we hae explored tmendependent (resste) elements that are also lnear. A tmendependent elements s one for whch we can plot an / cure.
More informationA Novel Methodology of Working Capital Management for Large. Public Constructions by Using Fuzzy S-curve Regression
Novel Methodology of Workng Captal Management for Large Publc Constructons by Usng Fuzzy S-curve Regresson Cheng-Wu Chen, Morrs H. L. Wang and Tng-Ya Hseh Department of Cvl Engneerng, Natonal Central Unversty,
More informationHow To Understand The Results Of The German Meris Cloud And Water Vapour Product
Ttel: Project: Doc. No.: MERIS level 3 cloud and water vapour products MAPP MAPP-ATBD-ClWVL3 Issue: 1 Revson: 0 Date: 9.12.1998 Functon Name Organsaton Sgnature Date Author: Bennartz FUB Preusker FUB Schüller
More informationL10: Linear discriminants analysis
L0: Lnear dscrmnants analyss Lnear dscrmnant analyss, two classes Lnear dscrmnant analyss, C classes LDA vs. PCA Lmtatons of LDA Varants of LDA Other dmensonalty reducton methods CSCE 666 Pattern Analyss
More information+ + + - - This circuit than can be reduced to a planar circuit
MeshCurrent Method The meshcurrent s analog of the nodeoltage method. We sole for a new set of arables, mesh currents, that automatcally satsfy KCLs. As such, meshcurrent method reduces crcut soluton to
More informationMaintenance Scheduling by using the Bi-Criterion Algorithm of Preferential Anti-Pheromone
Leonardo ournal of Scences ISSN 583-0233 Issue 2, anuary-une 2008 p. 43-64 Mantenance Schedulng by usng the B-Crteron Algorthm of Preferental Ant-Pheromone Trantafyllos MYTAKIDIS and Arstds VLACHOS Department
More informationCausal, Explanatory Forecasting. Analysis. Regression Analysis. Simple Linear Regression. Which is Independent? Forecasting
Causal, Explanatory Forecastng Assumes cause-and-effect relatonshp between system nputs and ts output Forecastng wth Regresson Analyss Rchard S. Barr Inputs System Cause + Effect Relatonshp The job of
More informationMAC Layer Service Time Distribution of a Fixed Priority Real Time Scheduler over 802.11
Internatonal Journal of Software Engneerng and Its Applcatons Vol., No., Aprl, 008 MAC Layer Servce Tme Dstrbuton of a Fxed Prorty Real Tme Scheduler over 80. Inès El Korb Ecole Natonale des Scences de
More informationn + d + q = 24 and.05n +.1d +.25q = 2 { n + d + q = 24 (3) n + 2d + 5q = 40 (2)
MATH 16T Exam 1 : Part I (In-Class) Solutons 1. (0 pts) A pggy bank contans 4 cons, all of whch are nckels (5 ), dmes (10 ) or quarters (5 ). The pggy bank also contans a con of each denomnaton. The total
More informationSection 5.4 Annuities, Present Value, and Amortization
Secton 5.4 Annutes, Present Value, and Amortzaton Present Value In Secton 5.2, we saw that the present value of A dollars at nterest rate per perod for n perods s the amount that must be deposted today
More informationData Broadcast on a Multi-System Heterogeneous Overlayed Wireless Network *
JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 24, 819-840 (2008) Data Broadcast on a Mult-System Heterogeneous Overlayed Wreless Network * Department of Computer Scence Natonal Chao Tung Unversty Hsnchu,
More informationGeneralizing the degree sequence problem
Mddlebury College March 2009 Arzona State Unversty Dscrete Mathematcs Semnar The degree sequence problem Problem: Gven an nteger sequence d = (d 1,...,d n ) determne f there exsts a graph G wth d as ts
More informationEnergy Conserving Routing in Wireless Ad-hoc Networks
Energy Conservng Routng n Wreless Ad-hoc Networks Jae-Hwan Chang and Leandros Tassulas Department of Electrcal and Computer Engneerng & Insttute for Systems Research Unversty of Maryland at College ark
More informationHeuristic Static Load-Balancing Algorithm Applied to CESM
Heurstc Statc Load-Balancng Algorthm Appled to CESM 1 Yur Alexeev, 1 Sher Mckelson, 1 Sven Leyffer, 1 Robert Jacob, 2 Anthony Crag 1 Argonne Natonal Laboratory, 9700 S. Cass Avenue, Argonne, IL 60439,
More informationNew Approaches to Support Vector Ordinal Regression
New Approaches to Support Vector Ordnal Regresson We Chu chuwe@gatsby.ucl.ac.uk Gatsby Computatonal Neuroscence Unt, Unversty College London, London, WCN 3AR, UK S. Sathya Keerth selvarak@yahoo-nc.com
More informationA Prefix Code Matching Parallel Load-Balancing Method for Solution-Adaptive Unstructured Finite Element Graphs on Distributed Memory Multicomputers
Ž. The Journal of Supercomputng, 15, 25 49 2000 2000 Kluwer Academc Publshers. Manufactured n The Netherlands. A Prefx Code Matchng Parallel Load-Balancng Method for Soluton-Adaptve Unstructured Fnte Element
More information