Optimal Scheduling Algorithms to Minimize Total Flowtime on a Two-Machine Permutation Flowshop with Limited Waiting Times and Ready Times of Jobs
|
|
- Jeffry Lyons
- 5 years ago
- Views:
Transcription
1 Optmal Schedulng Algorthms to Mnmze Total Flowtme on a Two-Machne Permutaton Flowshop wth Lmted Watng Tmes and Ready Tmes of Jobs Seong-Woo Cho Dept. Of Busness Admnstraton, Kyongg Unversty, Suwon-s, , South Korea., Orcd: Abstract In ths research, we consder a two-machne permutaton flowshop wth ready tmes and lmted watng tmes of obs n a semconductor fab. In the flowshop, each ob has ts correspondng ready tme (arrval tme) at machne (for the frst operaton) and lmted watng tme between the completon tme of the frst operaton on machne and the startng tme of the second operaton on machne. That s, the frst operaton of each ob cannot be started earler than ts ready tme on the machne, and the second operaton of each ob has to be started wthn ts correspondng lmted watng tme after ts frst operaton s completed on machne. In ths schedulng problem, the obectve s mnmzng the total flowtme of obs to be processed on the two-machne permutaton flowshop, and we suggested branch and bound algorthms to gve optmal solutons. To boost effcency of the suggested branch and bound algorthms, we developed several domnance propertes and three lower boundng schemes, and we used these n the branch and bound algorthms. In addton, we used the solutons of exstng heurstc algorthm as the ntal upper bounds of the branch and bound algorthms. To evaluate the performances of the branch and bounds, we executed computatonal smulaton test and showed the results. Keywords: lmted watng tme, ready tme, total flowtme, branch and bound algorthm INTRODUCTION In ths research, we consder a two-machne permutaton flowshop schedulng problem wth ready tmes and lmted watng tmes of obs n a semconductor fab, and the obectve functon s mnmzng the total flowtme of obs to be processed. In ths schedulng problem, the frst operaton of each ob cannot be started earler than ts ready tme on the machne and each ob has to start ts second operaton on machne wthn ts correspondng lmted watng tme after ts frst operaton on machne s completed. Ths schedulng problem can be denoted as F/r, maxwat/ (C -r ), whch s based on the three-feld notaton of Graham et al. [] n whch r and max-wat mean that obs cannot be processed on the frst machne earler than ther arrval tmes and have to be processed on the second machne wthn a certan perod of tme after those obs are completed on the frst machne, respectvely, and (C -r ) s the total flowtme of obs, and note that the typcal two-machne flowshop s a specal case of the schedulng problem of ths research [, 3, 4]. Such a two-machne permutaton flowshop can be found n a semconductor manufacturng lne (fab). For example, at the workstaton wth clean and dffuson operatons n a semconductor fabrcaton lne, after a chemcal treatment (clean) operaton for a wafer lot s completed on the clean machne (machne ), the next operaton (dffuson) for the wafer lot must be started on the dffuson machne (machne ) wthn ts pre-determned tme perod called lmted watng tme (the length of lmted watng tmes may be dfferent accordng to the recpes), and f the next operaton for the wafer lots s delayed, t must be abandoned or re-processed because the chemcal treatment s no longer effectve after the tme perod [, 4, 5]. On the other hand, snce the workstaton above may not be the frst operaton of semconductor fabs n general, obs arrve at ths workstaton dynamcally, that s, obs have dfferent postve arrval tmes at the machne (for the clean operaton) of ths operaton secton (clean-dffuson) [3, 6]. Many researchers have studed the typcal flowshop schedulng problems [7, 8 and 9]. In addton, as the followng researches, there are some studes for the flowshop schedulng problem wth lmted watng tmes and ready tmes of obs, respectvely. Tade et al. [0] and Potts [] suggested branch and bound algorthm and nvestgated the worst-case performance of fve approxmaton algorthms for mnmzng makespan on the two-machne flowshop wth release date, respectvely, and n the researches of Hall [] and Chu [3], a polynomal approxmaton scheme and a branch and bound algorthm were suggested for mnmzng makespan and total tardness on the two-machne flow-shop wth release date, respectvely [, 4]. Cho [, 3] suggested branch and bound 50
2 algorthms and heurstc algorthms for the schedulng problem wth ready tmes and lmted watng tmes of obs, and the obectve was mnmzng makespan. In addton, Cho [4] suggested varous heurstc algorthms for the same schedulng problem of ths research. However, there s no research whch suggested branch and bound algorthms, domnance propertes and lower boundng schemes for the schedulng problem on the two-machne flowshop wth ready tme, lmted watng tme and obectve functon of mnmzng total flowtme. PROBLEM DESCRIPTION In ths paper, the notatons below are used, and these were used n the research of Cho [, 3, 4]. p k ndces of obs, =,,..., n k ndces of machnes, k =, w r...m [] c k processng tme of ob on machne k lmted watng tme of ob ready tme of ob partal sequence partal schedule obtaned wth followed by obs,,...,m n ths order ob that s completed -th n a (partal) schedule completon tme of ob that s completed -th n a (partal) schedule on machne k C k() C -r (C -r ) completon tme of the last postoned ob n a partal schedule on machne k flowtme of ob total flowtme of all obs (obectve value of ths schedulng problem) In ths paper, only permutaton schedules (sequences) are consdered, n whch operaton sequences of obs are the same on the two machnes (machne and machne ), that s, the operaton orders of obs are not dfferenct on machne and. Although permutaton schedules are domnant n the ordnary two-machne flowshop schedulng problem wth the obectve of mnmzng makespan [4, 4, 5], t s not the case wth the lmted watng tme, the ready tmes and the obectve functon of mnmzng total flowtme, that s, there may be cases that a non-permutaton schedule (sequence) can be better than the best permutaton schedule (sequence). The example below s such a case. Example. (the case that permutaton schedules are not domnant) There are four obs to be scheduled, and the processng, lmted watng and ready tmes of obs are gven n Tables. In the fgure, we can confrm that the best permutaton schedule (b) can be obtaned by the operaton sequence (,, 3, 4) of obs, whle there s a better non-permutaton schedule, n whch the operaton sequence of obs s (, 3,, 4) on machne and the operaton sequence of obs s (,, 3, 4) on machne. Table : Processng, lmted watng and ready tmes of obs n the example = = = 3 = 4 p 4 p 4 w r 0 3 (a) Non-permutaton schedule (b) Best permutaton schedule Fgure : An example that best permutaton schedule are domnated by non-permutaton schedule However, n the schedulng problem of ths research, only permutaton schedules are consdered snce permutaton schedules are preferred to non-permutaton schedules n most real systems because of the the ease of materal flow 50
3 management mplementaton, and non-permutaton schedules are not feasble n many cases because of techncal constrants of materal handlng systems (4, 4, 5). In ths two-machne permutaton flowshop schedulng problem, there are n obs to be processed n the machne and then machne, and we use the assumptons of Cho [3] as follows. ) In the two-machne flowshop schedulng problem, we have a gven set of obs wth dfferent arrval tmes, that s, each ob can be operated on the machne at ts arrval tme. ) The operaton tmes and lmted queue tmes of the obs are known and dfferent from each other. 3) Each ob should start ts operaton on machne wthn ts correspondng lmted queue tme after the ob s operated on the machne. Wth the notatons above, Cho [, 3] expressed the completon tme of each ob n a complete or partal schedules as follows, and we use theseequatons n ths research [4]. c [] =r [] +p [] c [] = c []+ p []=r [] +p []+ p [] (E.) (E.) c [] = max{max(r [], c [-]) + p [], c [-]-w []} for =,, n (E.3) c [] = max{c [], c [-]} + p [] for =,, n (E.4) Domnance Propertes In ths secton, seven domnance propertes are suggested, and they can be used to elmnate some partal schedules (sequences) that are domnated by other partal schedules. By usng the suggested domnance propertes, the number of sub-problems to be consdered can be reduced n the suggested branch and bound algorthms n ths research. The seven domnance propertes can be proved by usng the Johnson s algorthm [5] (n whch the Johnson s rule s used for sequencng obs, for two-machne permutaton flowshop schedulng problems, and accordng to the Johnson s rule, ob precedes ob n an optmal sequence f mn{p, p } mn{p, p }.), domnance propertes developed by Tade et al. [6] (for a two-machne flowshop schedulng problem wth ready tmes) and domnance propertes (for mnmzaton of makespan on a two-machne flowshop wth lmted watng tme and ready tme) developed by Cho [3]. Proposton. There s a gven partal schedule, f we have two obs () and () satsfyng the followng four condtons: (C.) C () r r, (C.), mn{p, p } mn{p, p }, (C.3), p p + w and (C.4) p + p p + p, then partal schedule s domnated by. Proof. If we can show that (A.) C k() C k() and (A.) F() F() for k =,, the proof of ths proposton s completed. Here, for k =,, (A.) C k() C k() was already proved under the condtons (C)-(C3) n the research of Cho [3]. Therefore, we need to show only (A.) F() F() for k =,. We have the followng equaltes related to the completon tmes of obs and n schedules and from the equaltes (E.)-(E.4) at the end of the prevous secton [3]. C () = max{max(r, C ()) + p, C () w } C () = max{c (), C ()} + p C () = max{max(r, C ()) + p, C () w } C () = max{c (), C ()} + p C () = max{max(r, C ()) + p, C () w } C () = max{ C (), C ()} + p C () = max{max(r, C ()) + p, C () w } C () = max{c (), C ()} + p (e.) (e.) (e.3) (e.4) (e.5) (e.6) (e.7) (e.8) To show that (A.) F() F() for k =,, that s, F() = C () r + C () r F() = C () r + C () r, we need to show only C () C () snce (A.) F() F() s reduced to C () + C () C () + C () and C () C () was already satsfed by (A.) [3]. Here, from the condton (C.) C () r r of ths proposton, (e.) and (e.6) are reduced to C () = r + p + p and C () = r + p + p, recpectvely. In addton, from the condton (C.4) p + p p +p, C () C () s satsfed. In concluson, we have (A.) C k() C k() and (A.) F() F() for k =,. Ths completes the proof. Proposton. There s a gven partal schedule, f we have two obs () and () satsfyng the followng four condtons: (C.5) r C (), (C.) mn{p, p } mn{p, p }, (C.6) C () C () p, (C.3) p p + w and (C.4) p + p p +p, then partal schedule s domnated by. Proof. The proof procedure of ths proposton s smlar to that of proposton. That s, If we can show that (A.) C k() C k() and (A.) F() F() for k =,, the proof of ths proposton s completed. Here, for k =,, (A.) C k() C k() was already proved 503
4 under the condtons (C), (C3), (C5) and (C6) n the research of Cho [3]. Therefore, we need to show only (A.) F() F() for k =,. To show that (A.) F() F() for k =,, we need to show C () C () (refer to the proof procedure of proposton ). From the condtons (C.5) r C () and (C.6) C () C () p, (e.) can be reduced to C () = C () + p + p. In addton, from (e.5) and (e.6), we have C () = max{c (), C ()} + p = max{max{max(r, C ()) + p, C () w }, C ()} + p = max{() r + p + p, () C () + p + p, (3) C () w + p, (4) C () + p } [3]. Here, from the condton (C.4) p + p p + p, we can confrm that (e.) = C () = C () + p + p () C () + p + p = C () of (e.6), that s, C () C () s satsfed. In concluson, we have (A.) C k() C k() and (A.) F() F() for k =,. Ths completes the proof. Proofs for the propostons (3-5) below are skpped n ths paper, snce t can be proven easly n the smlar way wth those of propostons -. Proposton 3. There s a gven partal schedule, f we have two obs () and () satsfyng the followng four condtons: (C.5) r C (), (C.) mn{p, p } mn{ p, p }, (C.7) C () C () p + w and (C.8) C () + p C () p p + w, (C.4) p + p p + p and (C.9) p p, then partal schedule s domnated by. Proposton 4. There s a gven partal schedule, f we have two obs () and () satsfyng the followng four condtons: (C.0) C () r C (), (C.) r r, (C.) mn{p, p } mn{p, p }, (C.) C () r + p, (C.3) p p + w and (C.4) p + p p + p, then partal schedule s domnated by. Proposton 5. There s a gven partal schedule, f we have two obs () and () satsfyng the followng four condtons: (C.0) C () r C (), (C.) r r, (C.) mn{p, p } mn{p, p }, (C.3) r + p C () r + p + w and (C.4) C () + p r p p + w and (C.9) p p, then partal schedule s domnated by. Proof. Let s assume that there s an optmal schedule n whch * s not placed n the frst poston. Then, the optmal schedule can be denoted as *, where and are partal sequences of the optmal schedule, and s a nonempty partal sequence. To prove the proposton, we show that F(* ) F( * ) for any par of and. From the condton r * + p * + p * mn *{r } of ths proposton, all obs (except for *) cannot start ther frst operatons earler than r * + p * + p *. Therefore, even f * s scheduled n the frst poston n a complete schedule (* ), the startng tmes and the completon tmes of the obs (n of * ) cannot be earler than those of the obs (n of * ). That s, f we assume that ob ( *) s scheduled n the frst poston of and we can show C k() = C k(*), k=,, the proof of ths proposton s completed. Here, we have C () = r + p and C () = r + p + p. On the other hand, we have C (*) = max{c (*), r } + p, C (*) = max{c (*), C (*)} + p, C (*) = r * + p * and C (*) = r * + p * + p *. In addton, from the condton r * + p * + p * mn *{r } of ths proposton, C (*) and C (*) can be reduced to C (*) = max{c (*), r } + p = max{r * + p *, r } + p = r + p and C (*) = max{c (*), C (*)} + p = max{r + p, r *+p *+p *} + p = r + p + p. In concluson, we have C k() = C k(*) for k =,. Ths completes the proof. From proposton 6, the followng corollary holds: Corollary. There s a gven partal schedule, f we have two obs () and () satsfyng the followng condton: C (*) mn *{r }, then schedules that start wth * domnate the others. Lower Boundng schemes To calculate a lower bound on the total flowtme of a complete schedule constructed from a gven partal schedule, we add lower bounds on flowtmes of the unscheduled obs (that are not ncluded to the partal schedule ) to the total flowtme of the scheduled obs n the partal schedule. Frst, we show a modfed verson (proposton 7) based on the proposton of Km [7], and t wll be used to obtan a lower bound on the total flowtme. Here, Let C, =,,..., n be nonnegatve real numbers. Also, let r ()(S) denote the ready tme of the ob to be completed -th n schedule S. Ths proposton can be proved by the proposton of Km [7]. Proposton 6. If there s ob *, where r * + p * + p * mn *{r }, there exsts an optmal schedule n whch ob * s placed n the frst poston. Proposton 7. If C C. C n, then for any schedule S' n a typcal two-machne permutaton flowshop, 504
5 max{0, C r() (S )} max{0, C r() (SERT )}, where S ERT s the earlest ready tme sequence, n whch obs wth earler ready tmes are placed earler. In ths proposton, f we let C be the completon tme of the ob that s placed th among obs n an arbtrary sequence S for the two-machne permutaton flowshop, C C. C n s satsfed (for any sequence). In addton, f we let r () (S) denote the ready tme of the ob that s placed th among obs n S, from the proposton 7, the total flowtme of sequence S s no less than max{0, C r() (SERT )}. Here, we cannot know the exact completon tmes of the (unscheduled) obs that are not ncluded n a partal schedule. Therefore, we calculate the lower bounds on the completon tmes of the unscheduled obs n a partal schedule by usng the followng propostons. In addton, the notatons below are used n the followng propostons. U partal schedule correspondng to a node beng consdered n the branch and bound algorthm set of obs not scheduled yet,.e., those that are not ncluded n w* the largest lmted watng tme of obs n U r* the shortest processng tme of obs n U p {}k P k m the -th shortest processng tme on machne k among obs n U sum of processng tmes of operatons n the order of the shortest processng tmes (on machne k) among obs n U,.e., P k p {q}k q lower bounds (m =,, 3, there are three versons of lower bounds) on the completon tme on machne of the ob that s completed - th among obs n U (n any complete schedule that starts wth a partal schedule ) In the proposton 8, we can obtan three lower bounds (, and 3 ) on the completon tmes of the unscheduled obs, assocated wth a partal schedule through the relaxaton of ready tmes and lmted watng tmes of obs n U. Proposton 8. In the two-machne permutaton flowshop, the completon tme of the ob that s completed -th among obs n U (n any complete schedule that starts wth ) s no less than = max[max(c (), r*) + p {}, C ()] + P or max[max(c (), r*), C () w* p {}] + P + = max [, ]. 3 = p {} or Proof. P k s a lower bound on the tme needed to operate obs among obs ncluded n U on machne k. In the case of, snce the obs ncluded n U cannot start ts second operaton (on machne ) earler than max(c (), r*) + p {} or C (), the completon tme of the ob that s completed -th among obs ncluded n U s no less than max[max(c (), r*) + p {}, C ()] + P. Also, n the case of, snce the obs ncluded n U cannot start ts frst operaton (on machne ) earler than than max(c (), r*) or C () w* p {}, the completon tme of the ob that s completed -th among obs ncluded n U s no less than max[max(c (), r*), C () w* p {}] + P + p {}. Fnally, snce the proofs of 3 and are completed, (max [, ]) s obvous. Ths completes the proof. Usng the two propostons above (proposton 7 and 8), we can obtan a lower bound on the total flowtme of any complete schedule that can be constructed from a partal schedule as σ max{0, c U m (σσ r} max{0, r[] (SERT )} for m=,, 3, where r[] (SERT ) denotes the ready tme of the ob completed -th n an earlest ready tme sequence of obs n U, and therefore, we can obtan the three versons of lower bounds (LB, LB and LB3) by usng Branch and Bound Algorthms, and 3. In ths research, we suggest varous versons of branch and bound algorthms for the consdered schedulng problem. The suggested branch and bound algorthms are based on the typcal branch and bound algorthm of Baker [8]. In the branch and bound algorthms, a branch and bound tree s constructed to generate all possble schedules (sequences), that s, a node n the branch and bound tree means ts correspondng partal sequence (schedule), and a node at the k-th depth n the branch and bound tree means ts correspondng partal schedule for the frst-postoned k obs n a complete schedule [3, 4]. 505
6 In the branch and bound algorthms, to obtan ntal upper bounds, AGLS (Appled Greedy Local Search) algorthm of Cho [4] s used. For the same schedulng problem of ths research, Cho [4] suggested four heurstc algorthms, H, H, AN (Appled NEH) and AGLS. Among the four heurstc algorthms above, AGLS showed the best performance. AGLS algorthm was developed based on the extended neghborhood search algorthm of Km [9]. In AGLS algorthm, the ntal soluton (sequence) obtaned from AN algorthm s then mproved by nterchangng a par of obs n the sequence, and all pars of obs are consdered for nterchanges at each attempt for mprovement, and then ths algorthm s termnated when the current soluton cannot be mproved any more [ and 4]. The AN algorthm apples MN (modfed NEH) algorthm of Cho and Km [4] to the schedulng problem of ths research. Also, n the suggested branch and bound algorthm, chld nodes are generated from a selected parent node, and we prune some chld nodes (domnated by others) by usng the developed domnance propertes n ths research. In addton, for the nodes that are not pruned by the domnance propertes, we calculate the developed three lower bounds (LB, LB and LB3), and the we elmnate the nodes wth larger lower bounds than the current upper bound. Fnally, when we construct the branch and bound tree, the depth and frst rule s adopted, n whch we select a node wth the bggest number of obs among the consdered nodes (partal schedules) for the next branchng [3]. Smulaton Tests To confrm the effectveness of the suggested lower boundng schemes, the developed domnance propertes and the exstng ntal upper bound, and to show the performnaces of the branch and bound algorthms, we executed some smulaton tests on randomly generated problems. The smulaton test problems and the branch and bound algorthms were coded n C++ language, and computatonal experments were done on a desktop computer wth a 5 processor of.3 GHz clock speed. We generated the processng tmes on the two machnes (the frst and second machnes), the ready tmes and the lmted watng tmes of obs n the same way wth those of Cho [4] as follows. That s, the processng tmes (on the machne and the machne ) were randomly generated from DU(, 50), where DU(a, b) means the dscrete unform dstrbuton wth a range of [a, b], and lmted watng tmes of obs were generated from DU(, 00), and the ready tmes of obs were randomly generated from DU(0, LB3), n whch LB3 s the lower bound suggested n ths research [4]. To evaluate the effectveness of the suggested lower boundng schemes, the developed domnance propertes and the exstng ntal upper bound, we randomly generated 60 test problems, 0 problems for each of sx levels (0,,, 3, 4 and 5) for the number of obs. By conductng the tests above, we suggested the best branch and bound algorthm, and to see the the performnace of the best branch and bound algorthm, we generated 90 addtonal test problems, 0 problems for each of nne levels (6, 8, 0,, 4, 6, 8, 30 and 3) for the number of obs. In tables -5, for a test nstance, the CPU tme for a branch and bound algorthm means the CPU tme (n seconds counter) to fnd optmal soluton, and f a branch and bound algorthm cannot gve the optmal soluton wthn 3600 seconds ( hour), ts CPU tme becomes 3600 seconds. For a branch and bound algorthm, as average CPU tmes (ACPUT) and medan CPU tmes (MCPUT) decrease, the performances of the branch and bound algorthms get better. In addton, n tables -4, for a test nstance, the rato of CPU tme for a branch and bound algorthm means ts relatve rato of CPU tme n comparson wth that of other branch and bound algorthm (BB3), and the average rato of CPU tme for a B&B algorthm s the mean of the rato values of CPU tmes (ARCPUT) for 0 nstances for each of sx levels for the number of obs. For example, n a test problem, the rato of CPU tme of BB/BB3 s the relatve rato of CPU tme of BB n comparson wth that of BB3 (CPU tme of BB/CPU tme of BB3). That s, as ARCPUT of BB/BB3 ncreases, the performance of BB gets worse n comparson wth BB. Table :Results of the tests on the effectveness of the lower bounds n ACPUT (MCPUT ) ARCPUT* BB BB BB3 BB/BB3 BB/BB (0.30) (0.00) (0.00) (0.65) (0.00) (0.00) (.05) (0.006) (0.006) (.700) (0.00) (0.006) (30.95) (0.030) (0.030) (47.45) (0.040) (0.040) average CPU tme or lower bound on the average CPU tme, whch was computed assumng that the CPU tme for an nstance that has not been solved to optmalty wthn 3600 seconds s 3600 seconds medan CPU tme * average rato of CPU tmes of a branch and bound algorthm n comparson wth those of BB3 506
7 Frstly, we performed three branch and bound algorthms (BB, BB and BB3) wth dfferent lower bounds (LB, LB anc LB3), respectvely. In BB, BB and BB3, all the suggested domnance propertes were used n the branch and bound algorthms, and the soluton of GLS s used as ntal upper bound. In the Table, BB3 shows the best performances n terms of the average CPU tme and the medan CPU tme. Also, n term of average rato of CPU tme, ARCPTs of BB/BB3 are larger than those of BB/BB3, whch means that BB outperforms BB (LB s more effcent than LB). Secondly, we evaluated the effectveness of the developed domnance propertes. For ths evaluaton, we compared BB4 (n whch none of the domnance propertes s used) wth BB3 (n whch all domnance propertes are used). The results of the tests are shown n Table 3. When the suggested domnance propertes are not used, the CPU tmes ncrease, that s, the suggested domnance propertes are effectve. n Table 3:Results of the test on the effectveness of the domnance propertes ACPUT (MCPUT ) ARCPUT* BB3 BB4 BB4/BB (0.00) (0.00) (0.00) (0.006) (0.006) (0.00) (0.006) (0.00) (0.030) (0.050) (0.040) (0.090) Table 4:Results of the test on the effectveness of the ntal upper bound n ACPUT (MCPUT ) ARCPUT* BB3 BB5 BB5/BB (0.00) (0.030) (0.00) (0.050) (0.006) (0.40) (0.006) (0.85) (0.030) (0.400) (0.040) (6.070),, * See the footnotes of Table Thrdly, we compared BB5 (n whch ntal upper bounds were not used) wth BB3 (n whch the ntal upper bounds were used). The results of the tests are shown n Table 4. When the ntal upper bounds are not used, the CPU tmes ncrease sgnfcantly, that s, the brand and bound algorthm wth the ntal upper bounds becomes effectve. Fnally, to show the performances of the best branch and bound algorthm (BB3), we conducted the addtonal smulaton tests. Therefore, we randomly generated 90 addtonal test problems, 0 problems for each of nne levels (6, 8, 0,, 4, 6, 8, 30 and 3) for the number of obs, and n the Table 5, we show the ACPUT, MCPUT and NINS (the number of nstances that have not been solved to optmalty by BB3 wthn 3600s among 0 nstances). As you see n Table 5, BB3 could fnd optmal solutons for problems wth up to 8 obs n a reasonable amount of CPU tme.,, * See the footnotes of Table. 507
8 Table 5:Results of the test on the BB3 algorthm n ACPUT MCPUT NINS # , See the footnotes of Table. # number of nstances among 0 nstances that have not been solved to optmalty by the branch and bound algorthm wthn 3600s CONCLUDING REMARKS In ths research, we suggested the branch and bound algorthms for the schedulng problem wth the obectve functon of mnmzng the total flowtme n a two-machne permutaton flowshop wth ready tmes and lmted watng tmes of obs n semconductor fabs. To boost the effcency of the suggested branch and bound algorthms, we developed several domnance propertes and lower boundng schemes, and the upper bounds from the exstng heurstc algorthms were used n those. From the results of the smulaton tests, we could confrm that the branch and bound algorthms became more effcent by usng the developed domnance propertes, lower boundng schemes and ntal upper bounds, and the best branch and b ound algorthm (BB3) could fnd optmal solutons for problems wth up to 8 obs n a reasonable amount of CPU tme. We can (need to) extend the results of ths research n varous drectons. For example, t may be necessary to develop domnance propertes and lower bounds for the m-machne permutaton flowshop schedulng flowshop problems or flowshops wth the other obectve functons (mnmzng makespan or total tardness). Also, more general cases can be consdered, n whch setup tmes are requred between the operatons of obs wth dfferent recpes. We can fnd such schedulng problems easly n a semconductor manufacturng lne. ACKNOWLEDGMENTS Ths work was supported by Kyongg Unversty Research Grant 05. REFERENCES [] Graham, R. L., Lawler, E. L., Lenstra, J. K., and Rnnooy Kan, A. H. G., 979, Optmzaton and approxmaton n determnstc sequencng and schedulng, Annals of Dscrete Mathematcs, 5, pp [] Cho, S. W., 06, Heurstcs for a two-machne permutaton flowshop wth lmted queue tme constrant and arrval tmes n a semconductor manufacturng lne, Internatonal Journal of Appled Engneerng Research, (8), pp [3] Cho, S. W., 05, Optmzaton Algorthms for a Two-Machne Permutaton Flowshop wth Lmted Watng Tmes Constrant and Ready Tmes of Jobs, Journal of Informaton Technology Applcatons & Management,, pp. -7. [4] Cho, S. W., 07, Mnmzng total flowtme n a twomachne flowshop wth lmted watng tme constrant and ready tme n a semconductor fabrcaton plant, Submtted to Internatonal Journal of Operatons and Quanttatve Management. [5] Joo, B. J., and Km, Y. D., 009, A branch-and-bound algorthm for a two-machne flowshop schedulng problem wth lmted watng tme constrants, Journal of the Operatonal Research Socety, 60, pp [6] Cho, S. W., Lm, T. K., and Km, Y. D., 00, Heurstcs for Schedulng Wafer Lots at the Deposton Workstaton n a Semconductor Wafer Fab, Journal of the Korean Insttute of Industral Engneers, 36, pp [7] Chen, T. C. E., Gupta, J. N. D., and Wang, G., 000, A revew of flowshop schedulng research wth setup tmes, Producton and Operatons Management, 9, pp [8] Framnan, J. M., Gupta, J. N. D., and Lesten, R., 004, A revew and Classfcaton of heurstcs for permutaton flow-shop schedulng wth makespan obectve, Journal of Operatonal Research Socety, 55, pp [9] Gupta, J. N. D., and Stafford, J. E., 006, Flowshop schedulng research after fve decades, European Journal of Operatonal Research, 69, pp [0] Tade, R., Gupta, J. N. D., Della Croce, F., and Cortes, M., 998, Mnmzng makespan n the two-machne flow-shop wth release tmes, Journal of Operatonal Research Socety, 49, pp [] Potts, C. N., 985, Analyss of heurstcs for twomachne flow-shop sequencng subect to release dates, Mathematcs of Operatons research, 0, pp
9 [] Hall, L. A., 994, A polynomal approxmaton scheme for a constraned flow shop schedulng problem, Mathematcs of Operatons research, 9, pp [3] Chu, C. A., 99, branch and bound algorthm to mnmze total tardness wth dfferent release tmes, Naval Research Logstcs, 39, pp [4] Cho, S. W., and Km, Y. D., 007, Mnmzng makespan on a two-machne re-entrant flowshop, Journal of the Operatonal Research Socety, 58, pp [5] Johnson, S. M., 954, Optmal two- and three-stage producton schedules wth setup tmes ncluded, Naval Research Logstcs Quarterly,, pp [6] Tade, R., Gupta, J. N. D., Della Croce, F., and Cortes, M., 998, Mnmzng makespan n the two-machne flow-shop wth release tmes, Journal of Operatonal Research Socety, 49, pp [7] Km, Y. D., 974, 993, A new branch and bound algorthm for mnmzng mean tardness n twomachne flowshops, Computers and Operatons Research, 0, pp [8] Baker, K. R., 974, Introducton to Sequencng and Schedulng, John Wley & Sons, New York. [9] Km, Y. D, 993, Heurstcs for flowshop schedulng problems mnmzng mean tardness, Journal of Operatonal Research Socety, 44, pp
A Single-Machine Deteriorating Job Scheduling Problem of Minimizing the Makespan with Release Times
A Sngle-Machne Deteroratng Job Schedulng Problem of Mnmzng the Makespan wth Release Tmes Wen-Chung Lee, Chn-Cha Wu, and Yu-Hsang Chung Abstract In ths paper, we study a sngle-machne deteroratng ob schedulng
More informationIntegrated approach in solving parallel machine scheduling and location (ScheLoc) problem
Internatonal Journal of Industral Engneerng Computatons 7 (2016) 573 584 Contents lsts avalable at GrowngScence Internatonal Journal of Industral Engneerng Computatons homepage: www.growngscence.com/ec
More informationThe Minimum Universal Cost Flow in an Infeasible Flow Network
Journal of Scences, Islamc Republc of Iran 17(2): 175-180 (2006) Unversty of Tehran, ISSN 1016-1104 http://jscencesutacr The Mnmum Unversal Cost Flow n an Infeasble Flow Network H Saleh Fathabad * M Bagheran
More informationVARIATION OF CONSTANT SUM CONSTRAINT FOR INTEGER MODEL WITH NON UNIFORM VARIABLES
VARIATION OF CONSTANT SUM CONSTRAINT FOR INTEGER MODEL WITH NON UNIFORM VARIABLES BÂRZĂ, Slvu Faculty of Mathematcs-Informatcs Spru Haret Unversty barza_slvu@yahoo.com Abstract Ths paper wants to contnue
More informationThis is the Pre-Published Version.
Ths s the Pre-Publshed Verson. Abstract In ths paper we consder the problem of schedulng obs wth equal processng tmes on a sngle batch processng machne so as to mnmze a prmary and a secondary crtera. We
More informationEfficient algorithms for scheduling equal-length jobs with processing set restrictions on uniform parallel batch machines
Effcent algorthms for schedulng equal-length obs wth processng set restrctons on unform parallel batch machnes Shuguang L,1, 1 Key Laboratory of Intellgent Informaton Processng n Unverstes of Shandong
More informationSimultaneous Optimization of Berth Allocation, Quay Crane Assignment and Quay Crane Scheduling Problems in Container Terminals
Smultaneous Optmzaton of Berth Allocaton, Quay Crane Assgnment and Quay Crane Schedulng Problems n Contaner Termnals Necat Aras, Yavuz Türkoğulları, Z. Caner Taşkın, Kuban Altınel Abstract In ths work,
More informationThe Study of Teaching-learning-based Optimization Algorithm
Advanced Scence and Technology Letters Vol. (AST 06), pp.05- http://dx.do.org/0.57/astl.06. The Study of Teachng-learnng-based Optmzaton Algorthm u Sun, Yan fu, Lele Kong, Haolang Q,, Helongang Insttute
More informationCOMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS
Avalable onlne at http://sck.org J. Math. Comput. Sc. 3 (3), No., 6-3 ISSN: 97-537 COMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS
More informationSingle-Facility Scheduling over Long Time Horizons by Logic-based Benders Decomposition
Sngle-Faclty Schedulng over Long Tme Horzons by Logc-based Benders Decomposton Elvn Coban and J. N. Hooker Tepper School of Busness, Carnege Mellon Unversty ecoban@andrew.cmu.edu, john@hooker.tepper.cmu.edu
More informationSome modelling aspects for the Matlab implementation of MMA
Some modellng aspects for the Matlab mplementaton of MMA Krster Svanberg krlle@math.kth.se Optmzaton and Systems Theory Department of Mathematcs KTH, SE 10044 Stockholm September 2004 1. Consdered optmzaton
More informationOn the Multicriteria Integer Network Flow Problem
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 5, No 2 Sofa 2005 On the Multcrtera Integer Network Flow Problem Vassl Vasslev, Marana Nkolova, Maryana Vassleva Insttute of
More informationReal-Time Systems. Multiprocessor scheduling. Multiprocessor scheduling. Multiprocessor scheduling
Real-Tme Systems Multprocessor schedulng Specfcaton Implementaton Verfcaton Multprocessor schedulng -- -- Global schedulng How are tasks assgned to processors? Statc assgnment The processor(s) used for
More informationStructure and Drive Paul A. Jensen Copyright July 20, 2003
Structure and Drve Paul A. Jensen Copyrght July 20, 2003 A system s made up of several operatons wth flow passng between them. The structure of the system descrbes the flow paths from nputs to outputs.
More informationComplement of Type-2 Fuzzy Shortest Path Using Possibility Measure
Intern. J. Fuzzy Mathematcal rchve Vol. 5, No., 04, 9-7 ISSN: 30 34 (P, 30 350 (onlne Publshed on 5 November 04 www.researchmathsc.org Internatonal Journal of Complement of Type- Fuzzy Shortest Path Usng
More informationThe Order Relation and Trace Inequalities for. Hermitian Operators
Internatonal Mathematcal Forum, Vol 3, 08, no, 507-57 HIKARI Ltd, wwwm-hkarcom https://doorg/0988/mf088055 The Order Relaton and Trace Inequaltes for Hermtan Operators Y Huang School of Informaton Scence
More informationMMA and GCMMA two methods for nonlinear optimization
MMA and GCMMA two methods for nonlnear optmzaton Krster Svanberg Optmzaton and Systems Theory, KTH, Stockholm, Sweden. krlle@math.kth.se Ths note descrbes the algorthms used n the author s 2007 mplementatons
More informationSingle-machine scheduling with trade-off between number of tardy jobs and compression cost
Ths s the Pre-Publshed Verson. Sngle-machne schedulng wth trade-off between number of tardy jobs and compresson cost 1, 2, Yong He 1 Department of Mathematcs, Zhejang Unversty, Hangzhou 310027, P.R. Chna
More informationCollege of Computer & Information Science Fall 2009 Northeastern University 20 October 2009
College of Computer & Informaton Scence Fall 2009 Northeastern Unversty 20 October 2009 CS7880: Algorthmc Power Tools Scrbe: Jan Wen and Laura Poplawsk Lecture Outlne: Prmal-dual schema Network Desgn:
More informationprinceton univ. F 17 cos 521: Advanced Algorithm Design Lecture 7: LP Duality Lecturer: Matt Weinberg
prnceton unv. F 17 cos 521: Advanced Algorthm Desgn Lecture 7: LP Dualty Lecturer: Matt Wenberg Scrbe: LP Dualty s an extremely useful tool for analyzng structural propertes of lnear programs. Whle there
More informationEmbedded Systems. 4. Aperiodic and Periodic Tasks
Embedded Systems 4. Aperodc and Perodc Tasks Lothar Thele 4-1 Contents of Course 1. Embedded Systems Introducton 2. Software Introducton 7. System Components 10. Models 3. Real-Tme Models 4. Perodc/Aperodc
More informationA new Approach for Solving Linear Ordinary Differential Equations
, ISSN 974-57X (Onlne), ISSN 974-5718 (Prnt), Vol. ; Issue No. 1; Year 14, Copyrght 13-14 by CESER PUBLICATIONS A new Approach for Solvng Lnear Ordnary Dfferental Equatons Fawz Abdelwahd Department of
More informationNP-Completeness : Proofs
NP-Completeness : Proofs Proof Methods A method to show a decson problem Π NP-complete s as follows. (1) Show Π NP. (2) Choose an NP-complete problem Π. (3) Show Π Π. A method to show an optmzaton problem
More informationModule 9. Lecture 6. Duality in Assignment Problems
Module 9 1 Lecture 6 Dualty n Assgnment Problems In ths lecture we attempt to answer few other mportant questons posed n earler lecture for (AP) and see how some of them can be explaned through the concept
More informationChapter - 2. Distribution System Power Flow Analysis
Chapter - 2 Dstrbuton System Power Flow Analyss CHAPTER - 2 Radal Dstrbuton System Load Flow 2.1 Introducton Load flow s an mportant tool [66] for analyzng electrcal power system network performance. Load
More informationAmiri s Supply Chain Model. System Engineering b Department of Mathematics and Statistics c Odette School of Business
Amr s Supply Chan Model by S. Ashtab a,, R.J. Caron b E. Selvarajah c a Department of Industral Manufacturng System Engneerng b Department of Mathematcs Statstcs c Odette School of Busness Unversty of
More informationEEL 6266 Power System Operation and Control. Chapter 3 Economic Dispatch Using Dynamic Programming
EEL 6266 Power System Operaton and Control Chapter 3 Economc Dspatch Usng Dynamc Programmng Pecewse Lnear Cost Functons Common practce many utltes prefer to represent ther generator cost functons as sngle-
More informationA New Refinement of Jacobi Method for Solution of Linear System Equations AX=b
Int J Contemp Math Scences, Vol 3, 28, no 17, 819-827 A New Refnement of Jacob Method for Soluton of Lnear System Equatons AX=b F Naem Dafchah Department of Mathematcs, Faculty of Scences Unversty of Gulan,
More informationConvexity preserving interpolation by splines of arbitrary degree
Computer Scence Journal of Moldova, vol.18, no.1(52), 2010 Convexty preservng nterpolaton by splnes of arbtrary degree Igor Verlan Abstract In the present paper an algorthm of C 2 nterpolaton of dscrete
More informationSpeeding up Computation of Scalar Multiplication in Elliptic Curve Cryptosystem
H.K. Pathak et. al. / (IJCSE) Internatonal Journal on Computer Scence and Engneerng Speedng up Computaton of Scalar Multplcaton n Ellptc Curve Cryptosystem H. K. Pathak Manju Sangh S.o.S n Computer scence
More informationResource Allocation with a Budget Constraint for Computing Independent Tasks in the Cloud
Resource Allocaton wth a Budget Constrant for Computng Independent Tasks n the Cloud Wemng Sh and Bo Hong School of Electrcal and Computer Engneerng Georga Insttute of Technology, USA 2nd IEEE Internatonal
More informationProblem Set 9 Solutions
Desgn and Analyss of Algorthms May 4, 2015 Massachusetts Insttute of Technology 6.046J/18.410J Profs. Erk Demane, Srn Devadas, and Nancy Lynch Problem Set 9 Solutons Problem Set 9 Solutons Ths problem
More informationAnnexes. EC.1. Cycle-base move illustration. EC.2. Problem Instances
ec Annexes Ths Annex frst llustrates a cycle-based move n the dynamc-block generaton tabu search. It then dsplays the characterstcs of the nstance sets, followed by detaled results of the parametercalbraton
More informationLOW BIAS INTEGRATED PATH ESTIMATORS. James M. Calvin
Proceedngs of the 007 Wnter Smulaton Conference S G Henderson, B Bller, M-H Hseh, J Shortle, J D Tew, and R R Barton, eds LOW BIAS INTEGRATED PATH ESTIMATORS James M Calvn Department of Computer Scence
More informationMinimisation of the Average Response Time in a Cluster of Servers
Mnmsaton of the Average Response Tme n a Cluster of Servers Valery Naumov Abstract: In ths paper, we consder task assgnment problem n a cluster of servers. We show that optmal statc task assgnment s tantamount
More informationThe lower and upper bounds on Perron root of nonnegative irreducible matrices
Journal of Computatonal Appled Mathematcs 217 (2008) 259 267 wwwelsevercom/locate/cam The lower upper bounds on Perron root of nonnegatve rreducble matrces Guang-Xn Huang a,, Feng Yn b,keguo a a College
More informationApplication of B-Spline to Numerical Solution of a System of Singularly Perturbed Problems
Mathematca Aeterna, Vol. 1, 011, no. 06, 405 415 Applcaton of B-Splne to Numercal Soluton of a System of Sngularly Perturbed Problems Yogesh Gupta Department of Mathematcs Unted College of Engneerng &
More informationPrimal Dual Gives Almost Optimal Energy Efficient Online Algorithms
Prmal Dual Gves Almost Optmal Energy Effcent Onlne Algorthms Nkhl R. Devanur Zhy Huang Abstract We consder the problem of onlne schedulng of obs on unrelated machnes wth dynamc speed scalng to mnmze the
More informationPlanning and Scheduling to Minimize Makespan & Tardiness. John Hooker Carnegie Mellon University September 2006
Plannng and Schedulng to Mnmze Makespan & ardness John Hooker Carnege Mellon Unversty September 2006 he Problem Gven a set of tasks, each wth a deadlne 2 he Problem Gven a set of tasks, each wth a deadlne
More informationAnalysis of Discrete Time Queues (Section 4.6)
Analyss of Dscrete Tme Queues (Secton 4.6) Copyrght 2002, Sanjay K. Bose Tme axs dvded nto slots slot slot boundares Arrvals can only occur at slot boundares Servce to a job can only start at a slot boundary
More informationKernel Methods and SVMs Extension
Kernel Methods and SVMs Extenson The purpose of ths document s to revew materal covered n Machne Learnng 1 Supervsed Learnng regardng support vector machnes (SVMs). Ths document also provdes a general
More informationDETERMINATION OF TEMPERATURE DISTRIBUTION FOR ANNULAR FINS WITH TEMPERATURE DEPENDENT THERMAL CONDUCTIVITY BY HPM
Ganj, Z. Z., et al.: Determnaton of Temperature Dstrbuton for S111 DETERMINATION OF TEMPERATURE DISTRIBUTION FOR ANNULAR FINS WITH TEMPERATURE DEPENDENT THERMAL CONDUCTIVITY BY HPM by Davood Domr GANJI
More informationNON-CENTRAL 7-POINT FORMULA IN THE METHOD OF LINES FOR PARABOLIC AND BURGERS' EQUATIONS
IJRRAS 8 (3 September 011 www.arpapress.com/volumes/vol8issue3/ijrras_8_3_08.pdf NON-CENTRAL 7-POINT FORMULA IN THE METHOD OF LINES FOR PARABOLIC AND BURGERS' EQUATIONS H.O. Bakodah Dept. of Mathematc
More informationYong Joon Ryang. 1. Introduction Consider the multicommodity transportation problem with convex quadratic cost function. 1 2 (x x0 ) T Q(x x 0 )
Kangweon-Kyungk Math. Jour. 4 1996), No. 1, pp. 7 16 AN ITERATIVE ROW-ACTION METHOD FOR MULTICOMMODITY TRANSPORTATION PROBLEMS Yong Joon Ryang Abstract. The optmzaton problems wth quadratc constrants often
More informationA PROBABILITY-DRIVEN SEARCH ALGORITHM FOR SOLVING MULTI-OBJECTIVE OPTIMIZATION PROBLEMS
HCMC Unversty of Pedagogy Thong Nguyen Huu et al. A PROBABILITY-DRIVEN SEARCH ALGORITHM FOR SOLVING MULTI-OBJECTIVE OPTIMIZATION PROBLEMS Thong Nguyen Huu and Hao Tran Van Department of mathematcs-nformaton,
More informationComputing Correlated Equilibria in Multi-Player Games
Computng Correlated Equlbra n Mult-Player Games Chrstos H. Papadmtrou Presented by Zhanxang Huang December 7th, 2005 1 The Author Dr. Chrstos H. Papadmtrou CS professor at UC Berkley (taught at Harvard,
More informationErrors for Linear Systems
Errors for Lnear Systems When we solve a lnear system Ax b we often do not know A and b exactly, but have only approxmatons  and ˆb avalable. Then the best thng we can do s to solve ˆx ˆb exactly whch
More informationPerfect Competition and the Nash Bargaining Solution
Perfect Competton and the Nash Barganng Soluton Renhard John Department of Economcs Unversty of Bonn Adenauerallee 24-42 53113 Bonn, Germany emal: rohn@un-bonn.de May 2005 Abstract For a lnear exchange
More informationECE559VV Project Report
ECE559VV Project Report (Supplementary Notes Loc Xuan Bu I. MAX SUM-RATE SCHEDULING: THE UPLINK CASE We have seen (n the presentaton that, for downlnk (broadcast channels, the strategy maxmzng the sum-rate
More informationA Hybrid Variational Iteration Method for Blasius Equation
Avalable at http://pvamu.edu/aam Appl. Appl. Math. ISSN: 1932-9466 Vol. 10, Issue 1 (June 2015), pp. 223-229 Applcatons and Appled Mathematcs: An Internatonal Journal (AAM) A Hybrd Varatonal Iteraton Method
More informationA Modified Vogel s Approximation Method for Obtaining a Good Primal Solution of Transportation Problems
Annals of Pure and Appled Mathematcs Vol., No., 06, 6-7 ISSN: 79-087X (P), 79-0888(onlne) Publshed on 5 January 06 www.researchmathsc.org Annals of A Modfed Vogel s Appromaton Method for Obtanng a Good
More informationTotal tardiness minimisation in permutation flow shops: a simple approach based on a variable greedy algorithm
Total tardness mnmsaton n permutaton flow shops: a smple approach based on a varable greedy algorthm Jose Manuel Framnan, Raner Lesten To cte ths verson: Jose Manuel Framnan, Raner Lesten. Total tardness
More informationAssortment Optimization under MNL
Assortment Optmzaton under MNL Haotan Song Aprl 30, 2017 1 Introducton The assortment optmzaton problem ams to fnd the revenue-maxmzng assortment of products to offer when the prces of products are fxed.
More informationAn Admission Control Algorithm in Cloud Computing Systems
An Admsson Control Algorthm n Cloud Computng Systems Authors: Frank Yeong-Sung Ln Department of Informaton Management Natonal Tawan Unversty Tape, Tawan, R.O.C. ysln@m.ntu.edu.tw Yngje Lan Management Scence
More informationFinding Primitive Roots Pseudo-Deterministically
Electronc Colloquum on Computatonal Complexty, Report No 207 (205) Fndng Prmtve Roots Pseudo-Determnstcally Ofer Grossman December 22, 205 Abstract Pseudo-determnstc algorthms are randomzed search algorthms
More informationLecture Notes on Linear Regression
Lecture Notes on Lnear Regresson Feng L fl@sdueducn Shandong Unversty, Chna Lnear Regresson Problem In regresson problem, we am at predct a contnuous target value gven an nput feature vector We assume
More informationA COMPARISON OF HEURISTICS TO SOLVE A SINGLE MACHINE BATCHING PROBLEM WITH UNEQUAL READY TIMES OF THE JOBS. Oleh Sobeyko Lars Mönch
Proceedngs of the 2011 Wnter Smulaton Conference S. Jan, R.R. Creasey, J. Hmmelspach, K.P. Whte, and M. Fu, eds. A COMPARISON OF HEURISTICS TO SOLVE A SINGLE MACHINE BATCHING PROBLEM WITH UNEQUAL READY
More informationAppendix B. The Finite Difference Scheme
140 APPENDIXES Appendx B. The Fnte Dfference Scheme In ths appendx we present numercal technques whch are used to approxmate solutons of system 3.1 3.3. A comprehensve treatment of theoretcal and mplementaton
More informationModule 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur
Module 3 LOSSY IMAGE COMPRESSION SYSTEMS Verson ECE IIT, Kharagpur Lesson 6 Theory of Quantzaton Verson ECE IIT, Kharagpur Instructonal Objectves At the end of ths lesson, the students should be able to:
More informationLab 2e Thermal System Response and Effective Heat Transfer Coefficient
58:080 Expermental Engneerng 1 OBJECTIVE Lab 2e Thermal System Response and Effectve Heat Transfer Coeffcent Warnng: though the experment has educatonal objectves (to learn about bolng heat transfer, etc.),
More informationInteractive Bi-Level Multi-Objective Integer. Non-linear Programming Problem
Appled Mathematcal Scences Vol 5 0 no 65 3 33 Interactve B-Level Mult-Objectve Integer Non-lnear Programmng Problem O E Emam Department of Informaton Systems aculty of Computer Scence and nformaton Helwan
More informationPerron Vectors of an Irreducible Nonnegative Interval Matrix
Perron Vectors of an Irreducble Nonnegatve Interval Matrx Jr Rohn August 4 2005 Abstract As s well known an rreducble nonnegatve matrx possesses a unquely determned Perron vector. As the man result of
More informationON A DETERMINATION OF THE INITIAL FUNCTIONS FROM THE OBSERVED VALUES OF THE BOUNDARY FUNCTIONS FOR THE SECOND-ORDER HYPERBOLIC EQUATION
Advanced Mathematcal Models & Applcatons Vol.3, No.3, 2018, pp.215-222 ON A DETERMINATION OF THE INITIAL FUNCTIONS FROM THE OBSERVED VALUES OF THE BOUNDARY FUNCTIONS FOR THE SECOND-ORDER HYPERBOLIC EUATION
More informationA queuing theory approach to compare job shop and lean work cell considering transportations
A queung theory approach to compare ob shop and lean work cell consderng transportatons ohammad oshref-javad Department of Industral and Systems Engneerng Auburn Unversty Auburn, Alabama- 36849, USA Abstract
More informationNUMERICAL DIFFERENTIATION
NUMERICAL DIFFERENTIATION 1 Introducton Dfferentaton s a method to compute the rate at whch a dependent output y changes wth respect to the change n the ndependent nput x. Ths rate of change s called the
More informationA Scheduling Approach for Autonomous Vehicle Sequencing Problem at Multi-Intersections
Internatonal ournal of Operatons Research Internatonal ournal of Operatons Research, Vol 8, No 1, 57 68 (2011) A Schedulng Approach for Autonomous Vehcle Sequencng Problem at Mult-Intersectons e Yan 1,,
More informationarxiv: v1 [math.co] 12 Sep 2014
arxv:1409.3707v1 [math.co] 12 Sep 2014 On the bnomal sums of Horadam sequence Nazmye Ylmaz and Necat Taskara Department of Mathematcs, Scence Faculty, Selcuk Unversty, 42075, Campus, Konya, Turkey March
More information(Online First)A Lattice Boltzmann Scheme for Diffusion Equation in Spherical Coordinate
Internatonal Journal of Mathematcs and Systems Scence (018) Volume 1 do:10.494/jmss.v1.815 (Onlne Frst)A Lattce Boltzmann Scheme for Dffuson Equaton n Sphercal Coordnate Debabrata Datta 1 *, T K Pal 1
More informationLecture 4: November 17, Part 1 Single Buffer Management
Lecturer: Ad Rosén Algorthms for the anagement of Networs Fall 2003-2004 Lecture 4: November 7, 2003 Scrbe: Guy Grebla Part Sngle Buffer anagement In the prevous lecture we taled about the Combned Input
More informationOn the Throughput of Clustered Photolithography Tools:
On the hroughput of lustered Photolthography ools: Wafer Advancement and Intrnsc Equpment Loss Maruth Kumar Mutnur James R. Morrson, Ph.D. September 23, 2007 Presentaton Outlne Motvaton Model : Synchronous
More informationPortfolios with Trading Constraints and Payout Restrictions
Portfolos wth Tradng Constrants and Payout Restrctons John R. Brge Northwestern Unversty (ont wor wth Chrs Donohue Xaodong Xu and Gongyun Zhao) 1 General Problem (Very) long-term nvestor (eample: unversty
More informationThe binomial transforms of the generalized (s, t )-Jacobsthal matrix sequence
Int. J. Adv. Appl. Math. and Mech. 6(3 (2019 14 20 (ISSN: 2347-2529 Journal homepage: www.jaamm.com IJAAMM Internatonal Journal of Advances n Appled Mathematcs and Mechancs The bnomal transforms of the
More informationThe optimal delay of the second test is therefore approximately 210 hours earlier than =2.
THE IEC 61508 FORMULAS 223 The optmal delay of the second test s therefore approxmately 210 hours earler than =2. 8.4 The IEC 61508 Formulas IEC 61508-6 provdes approxmaton formulas for the PF for smple
More informationSOLVING CAPACITATED VEHICLE ROUTING PROBLEMS WITH TIME WINDOWS BY GOAL PROGRAMMING APPROACH
Proceedngs of IICMA 2013 Research Topc, pp. xx-xx. SOLVIG CAPACITATED VEHICLE ROUTIG PROBLEMS WITH TIME WIDOWS BY GOAL PROGRAMMIG APPROACH ATMII DHORURI 1, EMIUGROHO RATA SARI 2, AD DWI LESTARI 3 1Department
More informationFirst day August 1, Problems and Solutions
FOURTH INTERNATIONAL COMPETITION FOR UNIVERSITY STUDENTS IN MATHEMATICS July 30 August 4, 997, Plovdv, BULGARIA Frst day August, 997 Problems and Solutons Problem. Let {ε n } n= be a sequence of postve
More informationMaximizing the number of nonnegative subsets
Maxmzng the number of nonnegatve subsets Noga Alon Hao Huang December 1, 213 Abstract Gven a set of n real numbers, f the sum of elements of every subset of sze larger than k s negatve, what s the maxmum
More information(1, T) policy for a Two-echelon Inventory System with Perishableon-the-Shelf
Journal of Optmzaton n Industral Engneerng 6 (24) 3-4 (, ) polcy for a wo-echelon Inventory ystem wth Pershableon-the-helf Items Anwar Mahmood a,, Alreza Ha b a PhD Canddate, Industral Engneerng, Department
More informationAn Integrated OR/CP Method for Planning and Scheduling
An Integrated OR/CP Method for Plannng and Schedulng John Hooer Carnege Mellon Unversty IT Unversty of Copenhagen June 2005 The Problem Allocate tass to facltes. Schedule tass assgned to each faclty. Subect
More informationELASTIC WAVE PROPAGATION IN A CONTINUOUS MEDIUM
ELASTIC WAVE PROPAGATION IN A CONTINUOUS MEDIUM An elastc wave s a deformaton of the body that travels throughout the body n all drectons. We can examne the deformaton over a perod of tme by fxng our look
More informationCHAPTER-5 INFORMATION MEASURE OF FUZZY MATRIX AND FUZZY BINARY RELATION
CAPTER- INFORMATION MEASURE OF FUZZY MATRI AN FUZZY BINARY RELATION Introducton The basc concept of the fuzz matr theor s ver smple and can be appled to socal and natural stuatons A branch of fuzz matr
More informationInexact Newton Methods for Inverse Eigenvalue Problems
Inexact Newton Methods for Inverse Egenvalue Problems Zheng-jan Ba Abstract In ths paper, we survey some of the latest development n usng nexact Newton-lke methods for solvng nverse egenvalue problems.
More informationDifference Equations
Dfference Equatons c Jan Vrbk 1 Bascs Suppose a sequence of numbers, say a 0,a 1,a,a 3,... s defned by a certan general relatonshp between, say, three consecutve values of the sequence, e.g. a + +3a +1
More informationThe Second Anti-Mathima on Game Theory
The Second Ant-Mathma on Game Theory Ath. Kehagas December 1 2006 1 Introducton In ths note we wll examne the noton of game equlbrum for three types of games 1. 2-player 2-acton zero-sum games 2. 2-player
More informationCurve Fitting with the Least Square Method
WIKI Document Number 5 Interpolaton wth Least Squares Curve Fttng wth the Least Square Method Mattheu Bultelle Department of Bo-Engneerng Imperal College, London Context We wsh to model the postve feedback
More informationThree Algorithms for Flexible Flow-shop Scheduling
Aercan Journal of Appled Scences 4 (): 887-895 2007 ISSN 546-9239 2007 Scence Publcatons Three Algorths for Flexble Flow-shop Schedulng Tzung-Pe Hong, 2 Pe-Yng Huang, 3 Gwoboa Horng and 3 Chan-Lon Wang
More informationResearch on Route guidance of logistic scheduling problem under fuzzy time window
Advanced Scence and Technology Letters, pp.21-30 http://dx.do.org/10.14257/astl.2014.78.05 Research on Route gudance of logstc schedulng problem under fuzzy tme wndow Yuqang Chen 1, Janlan Guo 2 * Department
More informationChapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems
Numercal Analyss by Dr. Anta Pal Assstant Professor Department of Mathematcs Natonal Insttute of Technology Durgapur Durgapur-713209 emal: anta.bue@gmal.com 1 . Chapter 5 Soluton of System of Lnear Equatons
More informationThe L(2, 1)-Labeling on -Product of Graphs
Annals of Pure and Appled Mathematcs Vol 0, No, 05, 9-39 ISSN: 79-087X (P, 79-0888(onlne Publshed on 7 Aprl 05 wwwresearchmathscorg Annals of The L(, -Labelng on -Product of Graphs P Pradhan and Kamesh
More informationQueueing Networks II Network Performance
Queueng Networks II Network Performance Davd Tpper Assocate Professor Graduate Telecommuncatons and Networkng Program Unversty of Pttsburgh Sldes 6 Networks of Queues Many communcaton systems must be modeled
More informationBALANCING OF U-SHAPED ASSEMBLY LINE
BALANCING OF U-SHAPED ASSEMBLY LINE Nuchsara Krengkorakot, Naln Panthong and Rapeepan Ptakaso Industral Engneerng Department, Faculty of Engneerng, Ubon Rajathanee Unversty, Thaland Emal: ennuchkr@ubu.ac.th
More informationSimulated Power of the Discrete Cramér-von Mises Goodness-of-Fit Tests
Smulated of the Cramér-von Mses Goodness-of-Ft Tests Steele, M., Chaselng, J. and 3 Hurst, C. School of Mathematcal and Physcal Scences, James Cook Unversty, Australan School of Envronmental Studes, Grffth
More informationx = , so that calculated
Stat 4, secton Sngle Factor ANOVA notes by Tm Plachowsk n chapter 8 we conducted hypothess tests n whch we compared a sngle sample s mean or proporton to some hypotheszed value Chapter 9 expanded ths to
More informationU.C. Berkeley CS294: Beyond Worst-Case Analysis Luca Trevisan September 5, 2017
U.C. Berkeley CS94: Beyond Worst-Case Analyss Handout 4s Luca Trevsan September 5, 07 Summary of Lecture 4 In whch we ntroduce semdefnte programmng and apply t to Max Cut. Semdefnte Programmng Recall that
More informationHyper-Sums of Powers of Integers and the Akiyama-Tanigawa Matrix
6 Journal of Integer Sequences, Vol 8 (00), Artcle 0 Hyper-Sums of Powers of Integers and the Ayama-Tangawa Matrx Yoshnar Inaba Toba Senor Hgh School Nshujo, Mnam-u Kyoto 60-89 Japan nava@yoto-benejp Abstract
More informationGlobal Optimization of Truss. Structure Design INFORMS J. N. Hooker. Tallys Yunes. Slide 1
Slde 1 Global Optmzaton of Truss Structure Desgn J. N. Hooker Tallys Yunes INFORMS 2010 Truss Structure Desgn Select sze of each bar (possbly zero) to support the load whle mnmzng weght. Bar szes are dscrete.
More informationO-line Temporary Tasks Assignment. Abstract. In this paper we consider the temporary tasks assignment
O-lne Temporary Tasks Assgnment Yoss Azar and Oded Regev Dept. of Computer Scence, Tel-Avv Unversty, Tel-Avv, 69978, Israel. azar@math.tau.ac.l??? Dept. of Computer Scence, Tel-Avv Unversty, Tel-Avv, 69978,
More informationOn an Extension of Stochastic Approximation EM Algorithm for Incomplete Data Problems. Vahid Tadayon 1
On an Extenson of Stochastc Approxmaton EM Algorthm for Incomplete Data Problems Vahd Tadayon Abstract: The Stochastc Approxmaton EM (SAEM algorthm, a varant stochastc approxmaton of EM, s a versatle tool
More informationA Bayes Algorithm for the Multitask Pattern Recognition Problem Direct Approach
A Bayes Algorthm for the Multtask Pattern Recognton Problem Drect Approach Edward Puchala Wroclaw Unversty of Technology, Char of Systems and Computer etworks, Wybrzeze Wyspanskego 7, 50-370 Wroclaw, Poland
More informationMarkov Chain Monte Carlo Lecture 6
where (x 1,..., x N ) X N, N s called the populaton sze, f(x) f (x) for at least one {1, 2,..., N}, and those dfferent from f(x) are called the tral dstrbutons n terms of mportance samplng. Dfferent ways
More informationA NEW HYBRID RESCHEDULING POLICY BASED ON CUMULATIVE DELAY
A NEW HYBRID RESCHEDULING POLICY BASED ON CUULATIVE DELAY Haruhko Suwa, Toshhsa Fujwara Department of Industral and Systems Engneerng, Setsunan Unversty 17-8, Ikedanaka-mach, Neyagawa, Osaka 5728508, JAPAN
More information