Job Scheduling for Hybrid Assembly Differentiation Flowshop to Minimize Total Actual Flow Time
|
|
- Lesley Austen Collins
- 5 years ago
- Views:
Transcription
1 Job Schedulig for Hybrid Assembly Differetiatio Flowshop to Miimize Total Actual Flow Time Rahmi Maulidya, Rachmawati Wagsaputra, Suprayogi, Abdul Hakim Halim Faculty of Idustrial Techology Istitut Tekologi Badug (ITB), Idoesia Tel: (+062) , Abstract. This paper deals with schedulig problems of a hybrid assembly differetiatio flow shop cosistig of parts maufacturig, assembly operatio ad differetiatio stages. I the first stage, a umber of differet parts of a job are processed o (urelated) dedicated machies, ad the, i the secod stage, the completed parts are assembled o a commo machie to produce commo jobs. Fially, i the third stage cosistig dedicated machies, each particullar of the jobs is processed o a dedicated machie. The problem is to fid a job schedule so as to miimize total actual flow time to accommodate that parts should arrive i the shop at the right times ad i the right quatities, ad that the fiished product should be delivered at their due dates. A Mixed Iteger Liear Programmig (MILP) model is proposed to represet the problem ad it ca be solved efficietly for small size problems. However, for larger-size problems, a approach of heuristic algorithms (SPT-based ad NEH-based) for geeratig a iitial solutio, ad meta-heuristic algorithm (Hybrid Geetic Algorithm-Variable Neighborhood Search) for obtaiig the fial solutio is proposed. The approach is tested usig a set of hypothetic data, ad it ca be show that the algorithm ca solve the problems effectively. Keywords: job schedulig, hybrid assembly differetiatio flow shop, total actual flow time 1. INTRODUCTION It ca be observed that there are three stages i a doorlie of car maufacturig, i.e., machiig, assembly ad paitig i this order. I the machiig stage, door parts are maufactured. Those parts are assembled ito a body i the door lie for the ext step to produce variety of fiished products. The stage resultig variety of fiished products is called as a differetiatio stage (Li ad Hwag, 2011, Xiog et al., 2015). Cases for differetiatio as the fiishig stage ca be foud i paitig process (Xiog et al., 2015), ad cuttig process of sticker label (Li ad Liao, 2003). A differetiatio stage will result differet types of fiished products comig from the output of assembly operatio (Xiog et al., 2015). Xiog et al. (2015) have discussed schedulig problems with three stages maufacturig to miimize total flow time ad called a hybrid assembly differetiatio flow shops. The research icludes a fabricatio stage with three parallel machies, assembly stage with a sigle assembly machie, ad differetiatio stage with two dedicated machies each of which produces a type of products. This research is about a arragemet of machies called hybrid flowshop which flows sequecially with a differet umber of parallel machies i every stage (Ruiz ad Vazquez-Rodriguez, 2010). Researchers develop the hybrid flowshop schedulig problem based o variatio of shop cofiguratio, costrait, assumptio ad objective fuctio (Ruiz ad Vazquez-Rodriguez, 2010). The hybrid flow shop could be related to the differetiatio stage whe producig differet type of products ad the shop is arraged due to the product type. Accordig to Wag ad Liu (2013), hybrid flow shop with differetiatio stage has several ames, such as two-stage hybrid flow shop with dedicated machies (Li ad Liao, 2003, Wag ad Liu, 2013), two-stage differetiatio flowshop (Li ad Hwag, 2011) ad two-stage hybrid flow shop with machie eligibility. The hybrid flow shop could also be related to assembly operatio, kow as hybrid assembly flow shops, where parts from the fabricatio stage are assembled ito a assembly part at the assembly stage (Fattahi et al., 2014). The assembly operatio ca be arraged i assembly shop or assembly lie with coveyor (Morto ad Petico, 1993).
2 Operators of the assembly operatio do their job maually or usig tools or operatig semi automated machie (Groover, 2008). Accordig to a product structure, research has developed o oe assembly level (Fattahi et al., 2014, Halim ad Yusriski, 2009) ad two or more assembly levels (Thiagaraja ad Rajedra, 2005). A hybrid flowshop that is related to differetiatio stage ad assembly stage is kow as a hybrid assembly differetiatio flow shop. It is itroduced by Xiog et.al (2015). The research addresses job schedulig for three productio stages of the hybrid assembly differetiatio flow shop model where the first stage is compoet maufacturig, the secod stage is a assembly operatio ad the third stage is a differetiatio. The approach was the forward schedulig with the objective fuctio of miimizig total flow time. Literature shows that there is aother approach called the backward schedulig i which jobs are scheduled from the due date to the time zero directio. Much research o backward schedulig (Halim, 1993, Halim et.al., 2006) has adopted the criteria of total actual flow time (Halim ad Yusriski, 2009, Halim ad Ohta, 1994) is the criteria of the iterval time of parts i the shop floor. The total actual flow time is defied as the total miimizig iterval time betwee respective product's arrival times ad their commo due date. The actual flow time assumes that the product arrives at the shop floor whe eeded ad the completed product is delivered to the costumer at their due date. A part does ot have to be available at time zero but may arrive at the shop at the time of maufacturig. Therefore, the resultig schedule decisios give impact to the ivetory level ad part receivig time at the productio lie (Halim, 1993). I this paper, we develop a mathematical model ad a algorithm for hybrid assembly differetiatio flow shop to miimize total actual flow time. Sectio 2 describes ad formulates the model cosideratio. Sectio 3 shows the algorithm as a solutio for the problem. Sectio 4 shows the umerical examples ad the result for the problem. Sectio 5 cocludes the paper ad gives suggestios for future research. 2. PROBLEM FORMULATION The problem i this paper is developed for three stages productio system, i.e. machiig, assembly ad differetiatio stage, each of which has differet umber of machies. The system produces G types of products that is similar to the umber of machies at the third stage. Figure 1 shows the system we represet. I the first stage, a umber of differet parts of a job are processed o (urelated) dedicated machies. Parts are processed o each machie i the same order. I the secod stage, the completed parts are assembled o a commo machie to produce commo jobs. I the third stage cosistig dedicated machies, each particullar of the jobs is processed o a dedicated machie to become a certai type of product. All jobs are requested at a commo due date d. Figure 1. Three stages productio system The problem is to fid a job schedule so as to miimize total actual flow time to accommodate that parts should arrive i the shop at the right times i the right quatities, ad the fiished product should be delivered at their due dates. Several assumptios are made as follows: Productio are fiished at their commo due date Each machie ca process at most oe job at a time Each job ca be processed o at most oe machie at a time Setup times ad trasportatio times are eglected Job processig caot be preempted before it is fiished There are ulimited buffers betwee the machies of the stage oe ad two ad the stage two ad three Halim et al. (1994) defie actual flow time of a job as the time that the job speds i the shop from its startig time for processig util its due date. The actual flow time, F a [i], ca be formulated as follows: F a [i] = d B [i], i=1,2,, (1) Where d is a commo due date for jobs ad B [i] is the startig time for processig J [i]. The jobs are scheduled backwardly so the positio i is couted from the due date. Let us modify the formulatio of the actual flow time of a job for the problem cocered i this paper. F a [i] = d mi (B (1) k K [i],k) (2) The geeral formulatio of the total actual flow time (TAFT) is: (B (1) k K [i],k)) TAFT = i=1 (d mi (3)
3 This paper adopts the followig otatios: Idex j = idex of job, j=1, 2,, i = idex of job positios, i=1, 2,, k = idex of machies at the first stage, k=1, 2,...,K h = idex of machies at the third stage, also state the product type, h=1, 2,,G Parameter K = umber of machies at the firt stage G = umber of machies at the third stage = umber of processed job h = umber of job processed i machie h N = set of processed job N h = set of job that is processed i machie h d = commo due date M 1k = machie for processig part k of all the jobs at the first stage, k = 1, 2,,K M 2 = assembly machie i the secod stage M 3h = differetiatio machie for processig types of products i the third stage, h = 1, 2,,G (1) = the processig time of part k job j i machie M 1k at p j,k the first stage p j (2) = the processig time of assembly operatio of job j o machie M 2 at the secod stage p (3) j,h = the processig time of job j type h i machie M 3h at the third stage. p (3) j,h > 0 if j N h ; 0, otherwise. A j,h = the biary variable equals 1 if job j is assiged i machie h with the processig time p (3) j,h > 0 ; otherwise 0 Decisio variables = the biary variable equals 1 if job j is assiged to X j[i] positio i; otherwise 0 Y [i],h = the biary variable for the third stage equals 1 if (1) B [i],k (2) B [i] (3) B [i],h job i positio i is processed i machie h; otherwise 0; = the startig time of job i positio i i machie M 1k at the first stage = the startig time of assembly job i positio i i machie M 2 at the secod stage = the startig time of job i positio i i machie M 3h at the third stage Objective fuctio TAFT = total actual flow time The problem ca be formulated as follows. (B (1) k K [i],k)) Mi TAFT = i=1 (d mi (4) Subject to: i i =1 (3) B [i],h (3) ) = Y [i],h (d j=1 (X j[i ]. p j,h ), i i, i, h (5) (2) + (X j[i]. p (2) j=1 j ) d (Y [i],h B [i] B [i],k (1) B [i+1],k i i =1 (3) ) j=1 (X j[i ]. p j,h ), i i, i, h (6) (2) B [i+1] B [i] (X j[i+1]. p (2) j=1 j ), i <, i (7) (1) + (X j[i]. p (2) j=1 j,k ) B [i] i, k (8) B [i],k (X j[i+1]. p j=1 j,k ), i <, i, k (9) A j,h = { 1, if p (3) j,h > 0 0, if p (3) j,h = 0 j = 1,2.., h (10) j=1 (X j[i]. A j,h ) = Y [i],h, i, h (11) j=1 X j[i] = 1, i = 1,2.. (12) i=1 X j[i] = 1, j = 1,2.. (13) X j[i] {0,1} (14) B (1) [i],k, B (2) [i], B (3) [i],h 0, ad iteger (15) The objective fuctio (4) shows the total actual flow time that is calculated from the actual flow time of all positio where the actual flow time of each positio is the logest iterval betwee the part beig processed i the first stage util its commo due date. Costrait (5) defie the startig time of job i positio i i machie h at the third stage from its commo due date cosiderig the decisio that positio i is assiged i machie h. Costrait (6) defie the startig time of job i positio i at the secod stage from backward based o job i positio i at the third stage, with coditio where i i. Costrait (7) ad (9) esure that each positio ca oly be processed at the same stage after the ext positio is fiished. Costrait (8) defie the startig time of job i positio i o machie k at the first stage based o the startig time of the same job i positio i at the secod stage. Costrait (10) defie the job with the processig time at the third stage greater tha zero, is processed i machie h at the third stage. Costrait (11) decide the job i positio i that is assiged o machie h at the third stage oly if the value is 1. Costrait (12) ad (13) esure that each positio i the sequece of job is assiged to oly oe job, ad each job is assiged oly to oe positio i the sequece of job. Costrait (14) ad (15) defie the domai of the decisio variables.
4 3. SOLUTION The decisio variable of this model are the startig time of jobs o each stage ad the job sequece. Followig is the algorithm developed i Xiog et.al (2015) that cosists of two heuristics (SPT-based algorithm ad NEHbased algorithm) as a a iitial solutio ad the metaheuristic algorithm (Hybrid Geetic Algorithm-Variable Neighborhood Search) for fidig the best solutio. I this paper, we modify the algorithm by schedulig the jobs backwardly from the due date to miimize the total actual flow time. The algorithms to determie iitial solutio for the Hybrid Assembly Differetiatio Flow Shop-Total Actual Flow Time are as follows. SPT-based heuristic Step 1: Geerate six job sequeces S 1, S 2, S 3, S 4, S 5, ad S 6 i icreasig orders of max max 1 k 3 (p j,k (1) ) + p (2) j, p (2) (3) j + p j,h 1 k 3 (p j,k ad (1) ), p j (2), p j,h max 1 k 3 (p j,k (3), (1) ) + p (2) j +p (3) j,h, respectively. Schedule the jobs from due date. Step 2: select the best oe of the six job sequeces as the solutio. The output it ad its TAFT value. NEH-based heuristic Step 1: obtai a job sequece S 0 i ascedig order of max {p (1) k=1,2,,k j,k } + p (2) j + max {p (3) h=1,2,..g j,h } Step 2: set r=2. Select the first two jobs from S 0 ad schedule jobs from due date to miimize the total actual flow time as if there are oly two jobs. Set the best oe as a curret solutio S 1. Step 3: while r<+1 do Set rr+1. Geerate r cadidate sequece by isertig the r th job i the job sequece S 0 i each slot of the curret solutio. Select the best oe with the least partial total actual flow time. Update the best oe as a curret solutio S 1. Ed while Step 4: output the curret solutio S 1 ad its TAFT value. The best iitial solutio is selected from the six job sequeces of SPT-based ad oe job sequece of NEHbased heuristic. The best iitial solutio will be the iput of the Hybrid Geetic Algorithm-Variable Neighborhood Search show as follows. The Hybrid Geetic Algorithm-Variable Neighborhood Search (HGA-VNS) Step 1: Iput the best iitial solutio for a istace ad set algorithm parameters. Step 2: Geerate Populatio Size idividuals as the iitial populatio. Set maximum rutime t max. Step 3: Is t* > t max? If Yes, Output the best solutio If No, go to step 4. Step 4: perform procedure VNSL-I o each idividual as follows. Iput iitial solutio x ad set maximum iteratio Radomly choose two positios u ad v, where u<v. Move the job i positio u to positio v, whereas all jobs i positio k, with k = u+1,,v, are shifted oe positio forward alog solutio x. The a ew solutio will be x. If TAFT (x ) < TAFT (x), the x x. else swap the job i positio u ad the job i positio v of solutio x. The a ew solutio will be x. If TAFT (x ) < TAFT (x), the x x. ed. Repeat this procedure util the maximum iteratio. Step 5: Fid the best idividual of the populatio ad improved it by procedure VNSL-II as follows. Iput iitial solutio x ad set maximum iteratio Radomly choose two positios u ad v, where u<v. Move the job radomly i positio u to positio v, whereas all jobs i positio k, with k = u+1,,v, are shifted oe positio forward alog solutio x. The a ew solutio will be x. If TAFT (x ) < TAFT (x), the x x. else Swap the job i positio u ad the job i positio v of solutio x. The a ew solutio will be x. If TAFT (x ) < TAFT (x), the x x. else Iverse the jobs betwee positios u ad v of solutio x. The a ew solutio will be x. If TAFT (x ) < TAFT (x), the x x. else Isert the job i positio u ad the job i positio u+1 betwee positio v ad v+1, whereas all jobs i positio k, with k = u+2,,v, are shifted two positios forward alog solutio x. The a ew solutio will be x. If TAFT (x ) < TAFT (x), the x x. ed. Repeat this procedure util the maximum iteratio. Step 6: Perform Geetic algorithm Step 6.1. Select the offsprig to the ext geeratio Select pairs of strigs from the curret populatio. Step 6.2. Perform crossover operatios Apply two poit crossover to selected pairs to geerate solutio. Step 6.3. Perform mutatio operatios Mutatio is performed o sigle idividuals like isert move, swap move ad iverse move operatio.
5 Step 6.4. Add the best strig to the curret populatio ad remove the other strig. Step 6.5. Go to step 6.1. for aother pairs of strigs util the maximum iteratio is achieved. Step 7: Collect rutime ad add the rutime ito t*. Go the step 3. Table 1. Processig time of =8, K=3, G=2 The best iitial solutio is obtaied with the sequece of J 4,J 8,J 1,J 5,J 3,J 7,J 2,J 6 ad TAFT=266 from the SPT-based heuristic algorithm. The, it is improved with the Hybrid Geetic Algorithm-Variable Neighborhood Search. Table 3. shows the result for the procedure of VNSL-I o step 4. Table 2. Result of the procedure of VNSL-I o step 4 Figure 2. Flowchart of the algorithm 4. NUMERICAL EXPERIENCE Suppose there is a istace of 8 jobs (=8) to be processed i the system. Table 1 shows the processig time of 2 product types (Type 1 ad Type 2). Type 1 cosists of jobs J 1, J 2, J 3 ad J 4, writte as N 1={J 1,J 2,J 3,J 4} ad type 2 cosists of jobs J 5, J 6,J 7 ad J 8 writte as N 2={J 5,J 6,J 7,J 8}. This illustratio is for the umber of jobs ()=8, the umber of machie i the first stage (K)=3, ad the umber of machie i the third stage (G)=2. The completed products should be delivered at commo due date d=1000. I Table 3, the best iitial solutio of J 4,J 8,J 1,J 5,J 3,J 7,J 2,J 6 is become the iitial solutio x ad the first isert move operatio is movig the job i positio u=2 (J 8) to positio v=6. The result of sequece is J 4,J 1,J 5,J 3,J 7,J 8,J 2,J 6 with TAFT=289. Because the solutio x is ot improved, the the ext procedure is swapig the job i positio u=3 (J 1) ad positio v=5 (J 3) ad the result of sequece is J 4,J 8,J 3,J 5,J 1,J 7,J 2,J 6 with TAFT=277. The best result is i the sequece of J 4,J 5,J 1,J 8,J 3,J 7,J 2,J 6 with TAFT=264 from step 4. Next step is procedure of VNSL-II o step 5. The procedure of isert move ad swap move are the same as i step 5. For the procedure of iverse move, the jobs are iversed betwee positio u=3 ad positio v=7. The result of sequece is J 4,J 5,J 2,J 7,J 3,J 8,J 1,J 6 with TAFT=317. For the procedure of Or-Opt move, the jobs are shifted two positios forward alog solutio x. The job i positio u=3 ad u+1=4 are iserted betwee positio v=6 ad v+1=7. The result of sequece is J 4,J 5,J 3,J 7,J 2,J 1,J 8,J 6 with TAFT=285. Table 4 shows the result for step 5 ad the best idividual populatio is the sequece of
6 J 4,J 5,J 1,J 8,J 3,J 7,J 2,J 6 with TAFT=264. I step 6.1, offsprig are geerated from two parets. The first paret is the sequece from step 5 with TAFT=264 ad the secod paret is the sequece from the best iitial solutio with TAFT=266. I step 6.2, Crossover is applied to geerate offsprig by exchagig some gees of the two parets. The first paret is J 4,J 5,J 1,J 8,J 3,J 7,J 2,J 6 ad the secod paret is J 4,J 8,J 1,J 5,J 3,J 7,J 2,J 6. Those are the paret chromosomes for two poit crossover. Table 3. Result for step 5 (procedure of VNSL-II) The two poit crossover are developed as follows. The paret chromosome A1 ad B1 are: The best solutio for the crossover procedure is J 4,J 5,J 1,J 8,J 3,J 7,J 2,J 6 with TAFT=264. O step 6.3, mutatio is performed o sigle idividuals like isert move, swap move ad iverse move operatio. Example for mutatio with iverse move ca be see as follows. The offsprig chromosome A1 ad B1 are: The repaired offsprig chromosome A1 ad B1 are: The mutatio operatio is performed i iversig the jobs betwee u=3 ad v=6, ad repeated util the maximum iteratio is achieved. The best solutio for the mutatio procedure is J 4,J 5,J 1,J 8,J 3,J 7,J 2,J 6 with TAFT=264. Gatt chart for the resultig schedule ca be see i Figure 4.
7 d = 1000 J6-1 J2-1 J6-2 J2-2 J7-1 J7-2 J3-2 J3-1 J8-2 J8-1 J1-2 J1-1 J5-2 J5-1 J4-2 J4-1 M11 M12 Machiig J6-3 J2-3 J7-3 J3-3 J8-3 J1-3 J5-3 J4-3 M13 J6 J2 J7 J3 J8 J1 J5 J4 M2 Assembly J2 J6 J3 J7 J8 J1 J5 J4 M31 M32 Differetiatio Figure 4. Gatt chart for the resultig schedule of =8, K=3, G=2 I order to shows the behaviour of the solutios, the umerical experiece is doe uder the combiatio of umber of jobs ( = 4, 6 ad 8), umber of machies o machiig stage (K = 3 ad 4), ad umber of machies o differetiatio stage (G = 2, 3, ad 4). Total problem sizes is obtaied from xkxg = 3x2x3 = 18 problem sizes. The istace for each umber of job is obtaied as a part of Table 1. For =4, the processig time ca be see from the itace of J 1, J 2, J 3 ad J 4, ad for =6, the processig time ca be see from the itace of J 1, J 2, J 3, J 4, J 5, ad J 6. All combiatio were ru o a PC with Itel Core i CPU, 3,10 GHz ad 8 GB RAM. The result of algorithm is compared to optimized model. Table 5 shows the compariso of optimized model ad algorithm. I Table 5, the symbol * shows that the result of optimized model is still o local optimal after the rutime is iterupted at 100 hours. It is probably because the istace is cosisted of duplicatio data ad ca ot get rid of loopig coditio. For problem size =4 ad =6, the algorithm solutio ca achieve the optimal solutio. The result ca be compared from the average gap. The SPTbased algorithm is the best iitial solutio with the average gap 1,9 compared to NEH-based algorithm. The HGA-VNS has the lowest average gap of 0,5. It meas that the HGA VNS ca effectively give the solutio for the medium ad large size problem. *local optimal, due to the completio time limitatio Table 4. Result of optimized model ad algorithm Model SPT NEH HGA-VNS K G TAFT TAFT Gap TAFT Gap TAFT Gap * * * * * Average CONCLUDING REMARKS This paper shows the problem of job schedulig for three stages productio system called the hybrid assembly
8 differetiatio flow shop, processig G differet types of products to miimize total actual flow time. The approach for this problem shows that fial schedule ca be obtaied from heuristics algorithms ad the fialized by metaheuristic algorithm. The umerical examples for this approach are limited to 4, 6 ad 8 jobs. The umber of iteratios ad the maximum rutime must be set higher to get better result. The illustratios have show the improvemet of the best solutio. The future research is to fid the proposed algorithm that ca give optimal solutio i short time compare to the curret approach. REFERENCES Fattahi, P., Hosseii, S.M.H., Jolai, F. ad Tavakkoli- Moghaddam, R. (2014) A Brach ad Boud Algorithm for Hybrid Flow Shop Schedulig Problem with Setup Time ad Assembly Operatio. Applied Mathematical Modellig, 38, Groover, M.P. (2008) Automatio, Productio Systems, ad Computer Itegrated Maufacturig, 3rd editio, Pearso Iteratioal Editio, NJ. Halim, A.H. (1993) Batch Schedulig for Productio System uder Just i Time Eviromet. Dissertatio. Osaka Perfecture Uiversity Jepag. Halim, A.H. ad Ohta, H. (1994) Batch Schedulig Problem to Miimize Ivetory Cost i the Shop with Both Receivig ad Delivery Just I Times. Iteratioal Joural of Productios Ecoomics, 33, Halim, A.H, Suryadhii, P.P ad Toha, I.S. (2006) Batch Schedulig to Miimize Total Actual Flow Time i a Two-stage Flow Shop with Dedicated Machies i the Secod Stage, Proc. of 7th Asia Pasific Idustrial Egieerig & Maagemet System (APIEMS) Cof December 2006 (Bagkok), Halim, A.H. ad Yusriski, R. (2009) Batch Schedulig for the Two-stage Assembly Model to Miimize Total Actual Flow Time. Proc. of 7th Asia Pasific Idustrial Egieerig & Maagemet System (APIEMS) Cof (Kitakyushu). Li, B.M.T. ad Hwag, F.J. (2011) Total Completio Time Miimizatio i a 2-Stage Differetiatio Flowshop with Fixed Sequeces per Job Type. Iformatio Processig Letters, 111, Li, H.T. ad Liao, C.J. (2003) A Case Study i a Twostage Hybrid Flowshop with Setup Time ad Dedicated Machies. Iteratioal Joural of Productio Ecoomics, 86, Morto, T.E. ad Petico, D.W. (1993) Heuristic Schedulig System with Applicatio i Productio System ad Project Maagemet. Joh Wiley & sos, New York. Ruiz, R. ad Vazquez-Rodriguez, J.A. (2010) The Hybrid Flow Shop Schedulig Problem. Europea Joural of Operatio Research, 205, Thiagaraja, S. ad Rajedra, C. (2005) Schedulig i Dyamic Assembly Job-Shops to Miimize the Sum of Weighted Earliess, Weighted Tardiess, ad Weighted Flow Time of Jobs. Computer & Idustrial Egieerig, 49, Wag, S. ad Liu, M. (2013) A heuristic method for twostage hybrid flow shop with dedicated machies. Computers & Operatios Research, 40, Xiog, F., Xig, K. ad Wag, F. (2015) Schedulig a Hybrid Assembly-Differetiatio Flow Shop to Miimize Total Flow Time. Europea Joural of Operatio Research, 240, BIOGRAPHY Rahmi Maulidya is a lecturer at Idustrial Egieerig Departmet, Trisakti Uiversity i Jakarta, Idoesia. She received her udergraduate o Idustrial Egieerig, Trisakti Uiversity i 1998, ad her Master degree from Idustrial Egieerig ad Maagemet Istitut Tekologi Badug (ITB) i She is doctoral studet i Idustrial Egieerig ad Maagemet at Istitut Tekologi Badug (ITB). Her research iterests are Productio Plaig ad Schedulig. Her address is rachmi@trisakti.ac.id ad rahmimaulidya@gmail.com. Rachmawati Wagsaputra is a lecturer at the Departmet of Idustrial Egieerig, Istitut Tekologi Badug (ITB). She received her doctoral degree from the Departmet of Idustrial Egieerig, New Mexico State Uiversity, USA i Her teachig ad research iterest iclude dyamic optimizatio, maufacturig systems desig, visio ad robotic system, maufacturig automatio ad artificial itelliget with special emphasis o itelliget visio system. Her address is rwagsap@mail.ti.itb.ac.id ad rachmawati_wagsaputra@yahoo.com. Suprayogi is a Associate Professor at Faculty of Idustrial Techology, Istitut Tekologi Badug (ITB). He received his udergraduate ad master degree i Idustrial Egieerig from ITB ad his Doctorate degree from Uiversity of Tokyo, Japa. His research iterests are Trasportatio ad Distributio, Maritime Logistic, Operatio Research, ad Soft Computig ad Algorithm Desig. His address is yogi@mail.ti.itb.ac.id
9 Abdul Hakim Halim is Professor of Idustrial Egieerig at Idustrial Egieerig Departmet, Istitut Tekologi Badug (ITB), Badug, Idoesia. He received his udergraduate ad master degree i Idustrial Egieerig from ITB, ad his Doctorate degree from Idustrial Egieerig Departmet, Osaka Prefecture Uiversity, Osaka, Japa. His research iterests are Productio Schedulig, Ivetory cotrol, FMS, ad JIT systems. He published his papers i Iteratioal Joural of Productio Research, Europea Joural of Operatioal Research, Iteratioal Joural of Productio Ecoomics, ad Productio Plaig ad Cotrol, as well as i Joural of Japa ad several atioal jourals o productio system writte i Idoesia. His address is ahakimhalim@mail.ti.itb.ac.id ad ahakimhalim@gmail.com.
Ones Assignment Method for Solving Traveling Salesman Problem
Joural of mathematics ad computer sciece 0 (0), 58-65 Oes Assigmet Method for Solvig Travelig Salesma Problem Hadi Basirzadeh Departmet of Mathematics, Shahid Chamra Uiversity, Ahvaz, Ira Article history:
More informationSolving Fuzzy Assignment Problem Using Fourier Elimination Method
Global Joural of Pure ad Applied Mathematics. ISSN 0973-768 Volume 3, Number 2 (207), pp. 453-462 Research Idia Publicatios http://www.ripublicatio.com Solvig Fuzzy Assigmet Problem Usig Fourier Elimiatio
More informationMałgorzata Sterna. Mateusz Cicheński, Mateusz Jarus, Michał Miszkiewicz, Jarosław Szymczak
Małgorzata Stera Mateusz Cicheński, Mateusz Jarus, Michał Miszkiewicz, Jarosław Szymczak Istitute of Computig Sciece Pozań Uiversity of Techology Pozań - Polad Scope of the Talk Problem defiitio MP Formulatio
More informationLecture 18. Optimization in n dimensions
Lecture 8 Optimizatio i dimesios Itroductio We ow cosider the problem of miimizig a sigle scalar fuctio of variables, f x, where x=[ x, x,, x ]T. The D case ca be visualized as fidig the lowest poit of
More informationAn Improved Shuffled Frog-Leaping Algorithm for Knapsack Problem
A Improved Shuffled Frog-Leapig Algorithm for Kapsack Problem Zhoufag Li, Ya Zhou, ad Peg Cheg School of Iformatio Sciece ad Egieerig Hea Uiversity of Techology ZhegZhou, Chia lzhf1978@126.com Abstract.
More informationHYBRID GENETIC ALGORITHM FOR ASSEMBLY FLOW-SHOP SCHEDULING PROBLEM WITH SEQUENCE-DEPENDENT SETUP AND TRANSPORTATION TIMES
V. Maazi Dalfard et al. Hibridi geetski algoritam za plairae poslova motaže a tekućo traci s vremeima za motir ae i trasport ovisima o redosliedu... Vahid Maazi Dalfard, Allahyar Ardakai, Tak Nazalsadat
More informationPattern Recognition Systems Lab 1 Least Mean Squares
Patter Recogitio Systems Lab 1 Least Mea Squares 1. Objectives This laboratory work itroduces the OpeCV-based framework used throughout the course. I this assigmet a lie is fitted to a set of poits usig
More informationMulti Attributes Approach for Tourist Trips Design
Multi Attributes Approach for Tourist Trips Desig Ilaria Baffo 1, Pasquale Caroteuto 2, Atoella Petrillo 3, Fabio De Felice 4 1 Idustrial Egieerig School (DEIM) - Uiversity of Tuscia, Italy ilaria.baffo@uitus.it
More informationAn Estimation of Distribution Algorithm for solving the Knapsack problem
Vol.4,No.5, 214 Published olie: May 25, 214 DOI: 1.7321/jscse.v4.5.1 A Estimatio of Distributio Algorithm for solvig the Kapsack problem 1 Ricardo Pérez, 2 S. Jös, 3 Arturo Herádez, 4 Carlos A. Ochoa *1,
More informationLecture 5. Counting Sort / Radix Sort
Lecture 5. Coutig Sort / Radix Sort T. H. Corme, C. E. Leiserso ad R. L. Rivest Itroductio to Algorithms, 3rd Editio, MIT Press, 2009 Sugkyukwa Uiversity Hyuseug Choo choo@skku.edu Copyright 2000-2018
More informationFuzzy Rule Selection by Data Mining Criteria and Genetic Algorithms
Fuzzy Rule Selectio by Data Miig Criteria ad Geetic Algorithms Hisao Ishibuchi Dept. of Idustrial Egieerig Osaka Prefecture Uiversity 1-1 Gakue-cho, Sakai, Osaka 599-8531, JAPAN E-mail: hisaoi@ie.osakafu-u.ac.jp
More informationAn Algorithm to Solve Multi-Objective Assignment. Problem Using Interactive Fuzzy. Goal Programming Approach
It. J. Cotemp. Math. Scieces, Vol. 6, 0, o. 34, 65-66 A Algorm to Solve Multi-Objective Assigmet Problem Usig Iteractive Fuzzy Goal Programmig Approach P. K. De ad Bharti Yadav Departmet of Mathematics
More informationTask scenarios Outline. Scenarios in Knowledge Extraction. Proposed Framework for Scenario to Design Diagram Transformation
6-0-0 Kowledge Trasformatio from Task Scearios to View-based Desig Diagrams Nima Dezhkam Kamra Sartipi {dezhka, sartipi}@mcmaster.ca Departmet of Computig ad Software McMaster Uiversity CANADA SEKE 08
More informationA New Bit Wise Technique for 3-Partitioning Algorithm
Special Issue of Iteratioal Joural of Computer Applicatios (0975 8887) o Optimizatio ad O-chip Commuicatio, No.1. Feb.2012, ww.ijcaolie.org A New Bit Wise Techique for 3-Partitioig Algorithm Rajumar Jai
More informationLoad balanced Parallel Prime Number Generator with Sieve of Eratosthenes on Cluster Computers *
Load balaced Parallel Prime umber Geerator with Sieve of Eratosthees o luster omputers * Soowook Hwag*, Kyusik hug**, ad Dogseug Kim* *Departmet of Electrical Egieerig Korea Uiversity Seoul, -, Rep. of
More informationIntroduction. Nature-Inspired Computing. Terminology. Problem Types. Constraint Satisfaction Problems - CSP. Free Optimization Problem - FOP
Nature-Ispired Computig Hadlig Costraits Dr. Şima Uyar September 2006 Itroductio may practical problems are costraied ot all combiatios of variable values represet valid solutios feasible solutios ifeasible
More informationOPTIMAL SEQUENCE OF HOLE-MAKING OPERATIONS USING PARTICLE SWARM OPTIMISATION AND SHUFFLED FROG LEAPING ALGORITHM
Egieerig Review, Vol. 36, Issue, 187-196, 016. 187 OPTIMAL SEQUENCE OF HOLE-MAKING OPERATIONS USING PARTICLE SWARM OPTIMISATION AND SHUFFLED FROG LEAPING ALGORITHM Amol M. Dalavi 1* - Padmakar J. Pawar
More information9.1. Sequences and Series. Sequences. What you should learn. Why you should learn it. Definition of Sequence
_9.qxd // : AM Page Chapter 9 Sequeces, Series, ad Probability 9. Sequeces ad Series What you should lear Use sequece otatio to write the terms of sequeces. Use factorial otatio. Use summatio otatio to
More informationA New Morphological 3D Shape Decomposition: Grayscale Interframe Interpolation Method
A ew Morphological 3D Shape Decompositio: Grayscale Iterframe Iterpolatio Method D.. Vizireau Politehica Uiversity Bucharest, Romaia ae@comm.pub.ro R. M. Udrea Politehica Uiversity Bucharest, Romaia mihea@comm.pub.ro
More informationOptimization on Retrieving Containers Based on Multi-phase Hybrid Dynamic Programming
Available olie at www.sciecedirect.com ScieceDirect Procedia - Social ad Behavioral Scie ce s 96 ( 2013 ) 844 855 Abstract 13th COTA Iteratioal Coferece of Trasportatio Professioals (CICTP 2013) Optimizatio
More information6.854J / J Advanced Algorithms Fall 2008
MIT OpeCourseWare http://ocw.mit.edu 6.854J / 18.415J Advaced Algorithms Fall 2008 For iformatio about citig these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. 18.415/6.854 Advaced Algorithms
More informationEE 459/500 HDL Based Digital Design with Programmable Logic. Lecture 13 Control and Sequencing: Hardwired and Microprogrammed Control
EE 459/500 HDL Based Digital Desig with Programmable Logic Lecture 13 Cotrol ad Sequecig: Hardwired ad Microprogrammed Cotrol Refereces: Chapter s 4,5 from textbook Chapter 7 of M.M. Mao ad C.R. Kime,
More informationAnalysis Metrics. Intro to Algorithm Analysis. Slides. 12. Alg Analysis. 12. Alg Analysis
Itro to Algorithm Aalysis Aalysis Metrics Slides. Table of Cotets. Aalysis Metrics 3. Exact Aalysis Rules 4. Simple Summatio 5. Summatio Formulas 6. Order of Magitude 7. Big-O otatio 8. Big-O Theorems
More informationCSC 220: Computer Organization Unit 11 Basic Computer Organization and Design
College of Computer ad Iformatio Scieces Departmet of Computer Sciece CSC 220: Computer Orgaizatio Uit 11 Basic Computer Orgaizatio ad Desig 1 For the rest of the semester, we ll focus o computer architecture:
More informationECE4050 Data Structures and Algorithms. Lecture 6: Searching
ECE4050 Data Structures ad Algorithms Lecture 6: Searchig 1 Search Give: Distict keys k 1, k 2,, k ad collectio L of records of the form (k 1, I 1 ), (k 2, I 2 ),, (k, I ) where I j is the iformatio associated
More informationPosition and Velocity Estimation by Ultrasonic Sensor
Positio ad Velocity Estimatio by Ultrasoic Sesor N Ramarao 1, A R Subramayam 2, J Chara Raj 2, Lalith B V 2, Varu K R 2 1 (Faculty of EEE, BMSIT & M, INDIA) 2 (Studets of EEE, BMSIT & M, INDIA) Abstract:
More informationHole Machining Path Planning Optimization Based on Dynamic Tabu Artificial Bee Colony Algorithm
Research Joural of Applied Scieces, Egieerig ad Techology 5(4): 1454-1460, 2013 ISSN: 2040-7459; e-issn: 2040-7467 Maxwell Scietific Orgaizatio, 2013 Submitted: August 17, 2012 Accepted: September 17,
More informationCopyright 2016 Ramez Elmasri and Shamkant B. Navathe
Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe CHAPTER 19 Query Optimizatio Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe Itroductio Query optimizatio Coducted by a query optimizer i a DBMS Goal:
More informationProject 2.5 Improved Euler Implementation
Project 2.5 Improved Euler Implemetatio Figure 2.5.10 i the text lists TI-85 ad BASIC programs implemetig the improved Euler method to approximate the solutio of the iitial value problem dy dx = x+ y,
More informationElementary Educational Computer
Chapter 5 Elemetary Educatioal Computer. Geeral structure of the Elemetary Educatioal Computer (EEC) The EEC coforms to the 5 uits structure defied by vo Neuma's model (.) All uits are preseted i a simplified
More informationcondition w i B i S maximum u i
ecture 10 Dyamic Programmig 10.1 Kapsack Problem November 1, 2004 ecturer: Kamal Jai Notes: Tobias Holgers We are give a set of items U = {a 1, a 2,..., a }. Each item has a weight w i Z + ad a utility
More informationChapter 9. Pointers and Dynamic Arrays. Copyright 2015 Pearson Education, Ltd.. All rights reserved.
Chapter 9 Poiters ad Dyamic Arrays Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 9.1 Poiters 9.2 Dyamic Arrays Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Slide 9-3
More informationChapter 1. Introduction to Computers and C++ Programming. Copyright 2015 Pearson Education, Ltd.. All rights reserved.
Chapter 1 Itroductio to Computers ad C++ Programmig Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 1.1 Computer Systems 1.2 Programmig ad Problem Solvig 1.3 Itroductio to C++ 1.4 Testig
More informationImprovement of the Orthogonal Code Convolution Capabilities Using FPGA Implementation
Improvemet of the Orthogoal Code Covolutio Capabilities Usig FPGA Implemetatio Naima Kaabouch, Member, IEEE, Apara Dhirde, Member, IEEE, Saleh Faruque, Member, IEEE Departmet of Electrical Egieerig, Uiversity
More informationAlpha Individual Solutions MAΘ National Convention 2013
Alpha Idividual Solutios MAΘ Natioal Covetio 0 Aswers:. D. A. C 4. D 5. C 6. B 7. A 8. C 9. D 0. B. B. A. D 4. C 5. A 6. C 7. B 8. A 9. A 0. C. E. B. D 4. C 5. A 6. D 7. B 8. C 9. D 0. B TB. 570 TB. 5
More informationCIS 121 Data Structures and Algorithms with Java Spring Stacks, Queues, and Heaps Monday, February 18 / Tuesday, February 19
CIS Data Structures ad Algorithms with Java Sprig 09 Stacks, Queues, ad Heaps Moday, February 8 / Tuesday, February 9 Stacks ad Queues Recall the stack ad queue ADTs (abstract data types from lecture.
More informationBOOLEAN MATHEMATICS: GENERAL THEORY
CHAPTER 3 BOOLEAN MATHEMATICS: GENERAL THEORY 3.1 ISOMORPHIC PROPERTIES The ame Boolea Arithmetic was chose because it was discovered that literal Boolea Algebra could have a isomorphic umerical aspect.
More informationLower Bounds for Sorting
Liear Sortig Topics Covered: Lower Bouds for Sortig Coutig Sort Radix Sort Bucket Sort Lower Bouds for Sortig Compariso vs. o-compariso sortig Decisio tree model Worst case lower boud Compariso Sortig
More informationA Novel Approach to Solve Multiple Traveling Salesmen Problem by Genetic Algorithm
A Novel Approach to Solve Multiple Travelig Salesme Problem by Geetic Algorithm Adrás Király, Jáos Aboyi Uiversity of Paoia, Departmet of Process Egieerig, P.O. Box 58. Veszprém H-8200, HUNGARY, e-mail:
More informationSorting in Linear Time. Data Structures and Algorithms Andrei Bulatov
Sortig i Liear Time Data Structures ad Algorithms Adrei Bulatov Algorithms Sortig i Liear Time 7-2 Compariso Sorts The oly test that all the algorithms we have cosidered so far is compariso The oly iformatio
More informationA Note on Least-norm Solution of Global WireWarping
A Note o Least-orm Solutio of Global WireWarpig Charlie C. L. Wag Departmet of Mechaical ad Automatio Egieerig The Chiese Uiversity of Hog Kog Shati, N.T., Hog Kog E-mail: cwag@mae.cuhk.edu.hk Abstract
More informationFuzzy Linear Regression Analysis
12th IFAC Coferece o Programmable Devices ad Embedded Systems The Iteratioal Federatio of Automatic Cotrol September 25-27, 2013. Fuzzy Liear Regressio Aalysis Jaa Nowaková Miroslav Pokorý VŠB-Techical
More informationWhat are Information Systems?
Iformatio Systems Cocepts What are Iformatio Systems? Roma Kotchakov Birkbeck, Uiversity of Lodo Based o Chapter 1 of Beett, McRobb ad Farmer: Object Orieted Systems Aalysis ad Desig Usig UML, (4th Editio),
More informationChapter 5. Functions for All Subtasks. Copyright 2015 Pearson Education, Ltd.. All rights reserved.
Chapter 5 Fuctios for All Subtasks Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 5.1 void Fuctios 5.2 Call-By-Referece Parameters 5.3 Usig Procedural Abstractio 5.4 Testig ad Debuggig
More informationProbabilistic Fuzzy Time Series Method Based on Artificial Neural Network
America Joural of Itelliget Systems 206, 6(2): 42-47 DOI: 0.5923/j.ajis.2060602.02 Probabilistic Fuzzy Time Series Method Based o Artificial Neural Network Erol Egrioglu,*, Ere Bas, Cagdas Haka Aladag
More informationExact Minimum Lower Bound Algorithm for Traveling Salesman Problem
Exact Miimum Lower Boud Algorithm for Travelig Salesma Problem Mohamed Eleiche GeoTiba Systems mohamed.eleiche@gmail.com Abstract The miimum-travel-cost algorithm is a dyamic programmig algorithm to compute
More informationCubic Polynomial Curves with a Shape Parameter
roceedigs of the th WSEAS Iteratioal Coferece o Robotics Cotrol ad Maufacturig Techology Hagzhou Chia April -8 00 (pp5-70) Cubic olyomial Curves with a Shape arameter MO GUOLIANG ZHAO YANAN Iformatio ad
More informationA Genetic Algorithm for Multiple Inspections with Multiple Objectives
America Joural of Operatios Research, 2013, 3, 463-473 Published Olie November 2013 (http://www.scirp.org/joural/ajor) http://dx.doi.org/10.4236/ajor.2013.36045 A Geetic Algorithm for Multiple Ispectios
More informationComputers and Scientific Thinking
Computers ad Scietific Thikig David Reed, Creighto Uiversity Chapter 15 JavaScript Strigs 1 Strigs as Objects so far, your iteractive Web pages have maipulated strigs i simple ways use text box to iput
More informationReversible Realization of Quaternary Decoder, Multiplexer, and Demultiplexer Circuits
Egieerig Letters, :, EL Reversible Realizatio of Quaterary Decoder, Multiplexer, ad Demultiplexer Circuits Mozammel H.. Kha, Member, ENG bstract quaterary reversible circuit is more compact tha the correspodig
More informationChoosing an Optimal Set of Libraries
IEEE TRANSACTIONS ON RELIABILITY, VOL. 45, NO. 2, 1996 JUNE Choosig a Optimal Set of Libraries Oded Berma Uiversity of Toroto, Toroto Michal Cutler, Member IEEE State Uiversity of New York, Bighamto Keywords
More informationA SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON
A SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON Roberto Lopez ad Eugeio Oñate Iteratioal Ceter for Numerical Methods i Egieerig (CIMNE) Edificio C1, Gra Capitá s/, 08034 Barceloa, Spai ABSTRACT I this work
More information. Written in factored form it is easy to see that the roots are 2, 2, i,
CMPS A Itroductio to Programmig Programmig Assigmet 4 I this assigmet you will write a java program that determies the real roots of a polyomial that lie withi a specified rage. Recall that the roots (or
More informationHomework 1 Solutions MA 522 Fall 2017
Homework 1 Solutios MA 5 Fall 017 1. Cosider the searchig problem: Iput A sequece of umbers A = [a 1,..., a ] ad a value v. Output A idex i such that v = A[i] or the special value NIL if v does ot appear
More informationAssignment and Travelling Salesman Problems with Coefficients as LR Fuzzy Parameters
Iteratioal Joural of Applied Sciece ad Egieerig., 3: 557 Assigmet ad Travellig Salesma Problems with Coefficiets as Fuzzy Parameters Amit Kumar ad Aila Gupta * School of Mathematics ad Computer Applicatios,
More informationProtected points in ordered trees
Applied Mathematics Letters 008 56 50 www.elsevier.com/locate/aml Protected poits i ordered trees Gi-Sag Cheo a, Louis W. Shapiro b, a Departmet of Mathematics, Sugkyukwa Uiversity, Suwo 440-746, Republic
More informationNTH, GEOMETRIC, AND TELESCOPING TEST
NTH, GEOMETRIC, AND TELESCOPING TEST Sectio 9. Calculus BC AP/Dual, Revised 08 viet.dag@humbleisd.et /4/08 0:0 PM 9.: th, Geometric, ad Telescopig Test SUMMARY OF TESTS FOR SERIES Lookig at the first few
More informationA Parallel DFA Minimization Algorithm
A Parallel DFA Miimizatio Algorithm Ambuj Tewari, Utkarsh Srivastava, ad P. Gupta Departmet of Computer Sciece & Egieerig Idia Istitute of Techology Kapur Kapur 208 016,INDIA pg@iitk.ac.i Abstract. I this
More informationAn Integrated Matching and Partitioning Problem with Applications in Intermodal Transport
2015 IEEE Symposium Series o Computatioal Itelligece A Itegrated Matchig ad Partitioig Problem with Applicatios i Itermodal Trasport Erwi Pesch, Domiik Kress, Sebastia Meiswikel Uiversity of Siege Deptartmet
More informationWEBSITE STRUCTURE IMPROVEMENT USING ANT COLONY TECHNIQUE
WEBSITE STRUCTURE IMPROVEMENT USING ANT COLONY TECHNIQUE Wiwik Aggraei 1, Agyl Ardi Rahmadi 1, Radityo Prasetyo Wibowo 1 1 Iformatio System Departmet, Faculty of Iformatio Techology, Istitut Tekologi Sepuluh
More informationDynamic Programming and Curve Fitting Based Road Boundary Detection
Dyamic Programmig ad Curve Fittig Based Road Boudary Detectio SHYAM PRASAD ADHIKARI, HYONGSUK KIM, Divisio of Electroics ad Iformatio Egieerig Chobuk Natioal Uiversity 664-4 Ga Deokji-Dog Jeoju-City Jeobuk
More informationSOFTWARE usually does not work alone. It must have
Proceedigs of the 203 Federated Coferece o Computer Sciece ad Iformatio Systems pp. 343 348 A method for selectig eviromets for software compatibility testig Łukasz Pobereżik AGH Uiversity of Sciece ad
More informationSolutions to Final COMS W4115 Programming Languages and Translators Monday, May 4, :10-5:25pm, 309 Havemeyer
Departmet of Computer ciece Columbia Uiversity olutios to Fial COM W45 Programmig Laguages ad Traslators Moday, May 4, 2009 4:0-5:25pm, 309 Havemeyer Closed book, o aids. Do questios 5. Each questio is
More informationHeuristic Set-Covering-Based Postprocessing for Improving the Quine-McCluskey Method
Heuristic Set-Coverig-Based Postprocessig for Improvig the Quie-McCluskey Method Miloš Šeda Abstract Fidig the miimal logical fuctios has importat applicatios i the desig of logical circuits. This task
More informationISSN (Print) Research Article. *Corresponding author Nengfa Hu
Scholars Joural of Egieerig ad Techology (SJET) Sch. J. Eg. Tech., 2016; 4(5):249-253 Scholars Academic ad Scietific Publisher (A Iteratioal Publisher for Academic ad Scietific Resources) www.saspublisher.com
More informationPath Optimization For Computer Numerical Control-Printed Circuit Boards In Holes Drilling Process - Case Study
Iteratioal Joural of Egieerig ad Techology Volume 6 No.10, October, 2016 Path Optimizatio For Computer Numerical Cotrol-Prited Circuit Boards I Holes Drillig Process - Case Study Motaz Daadoo Departmet
More informationChapter 4 The Datapath
The Ageda Chapter 4 The Datapath Based o slides McGraw-Hill Additioal material 24/25/26 Lewis/Marti Additioal material 28 Roth Additioal material 2 Taylor Additioal material 2 Farmer Tae the elemets that
More information3D Model Retrieval Method Based on Sample Prediction
20 Iteratioal Coferece o Computer Commuicatio ad Maagemet Proc.of CSIT vol.5 (20) (20) IACSIT Press, Sigapore 3D Model Retrieval Method Based o Sample Predictio Qigche Zhag, Ya Tag* School of Computer
More informationOptimization of Multiple Input Single Output Fuzzy Membership Functions Using Clonal Selection Algorithm
Optimizatio of Multiple Iput Sigle Output Fuzzy Membership Fuctios Usig Cloal Selectio Algorithm AYŞE MERVE ACILAR, AHMET ARSLAN Computer Egieerig Departmet Selcuk Uiversity Selcuk Uiversity, Eg.-Arch.
More informationA Polynomial Interval Shortest-Route Algorithm for Acyclic Network
A Polyomial Iterval Shortest-Route Algorithm for Acyclic Network Hossai M Akter Key words: Iterval; iterval shortest-route problem; iterval algorithm; ucertaity Abstract A method ad algorithm is preseted
More informationImage Segmentation EEE 508
Image Segmetatio Objective: to determie (etract) object boudaries. It is a process of partitioig a image ito distict regios by groupig together eighborig piels based o some predefied similarity criterio.
More informationAn Efficient Algorithm for Graph Bisection of Triangularizations
A Efficiet Algorithm for Graph Bisectio of Triagularizatios Gerold Jäger Departmet of Computer Sciece Washigto Uiversity Campus Box 1045 Oe Brookigs Drive St. Louis, Missouri 63130-4899, USA jaegerg@cse.wustl.edu
More informationHow do we evaluate algorithms?
F2 Readig referece: chapter 2 + slides Algorithm complexity Big O ad big Ω To calculate ruig time Aalysis of recursive Algorithms Next time: Litterature: slides mostly The first Algorithm desig methods:
More informationAn Algorithm to Solve Fuzzy Trapezoidal Transshipment Problem
Iteratioal Joural of Systems Sciece ad Applied Mathematics 206; (4): 58-62 http://www.sciecepublishiggroup.com/j/ssam doi: 0.648/j.ssam.206004.4 A Algorithm to Solve Fuzzy Trapezoidal Trasshipmet Problem
More informationMining from Quantitative Data with Linguistic Minimum Supports and Confidences
Miig from Quatitative Data with Liguistic Miimum Supports ad Cofideces Tzug-Pei Hog, Mig-Jer Chiag ad Shyue-Liag Wag Departmet of Electrical Egieerig Natioal Uiversity of Kaohsiug Kaohsiug, 8, Taiwa, R.O.C.
More informationOptimization of Priority based CPU Scheduling Algorithms to Minimize Starvation of Processes using an Efficiency Factor
Iteratioal Joural of Computer Applicatios (97 8887) Volume 132 No.11, December21 Optimizatio of based CPU Schedulig Algorithms to Miimize Starvatio of Processes usig a Efficiecy Factor Muhammad A. Mustapha
More informationUniversity of Waterloo Department of Electrical and Computer Engineering ECE 250 Algorithms and Data Structures
Uiversity of Waterloo Departmet of Electrical ad Computer Egieerig ECE 250 Algorithms ad Data Structures Midterm Examiatio ( pages) Istructor: Douglas Harder February 7, 2004 7:30-9:00 Name (last, first)
More information5.3 Recursive definitions and structural induction
/8/05 5.3 Recursive defiitios ad structural iductio CSE03 Discrete Computatioal Structures Lecture 6 A recursively defied picture Recursive defiitios e sequece of powers of is give by a = for =0,,, Ca
More informationHeuristic Approaches for Solving the Multidimensional Knapsack Problem (MKP)
Heuristic Approaches for Solvig the Multidimesioal Kapsack Problem (MKP) R. PARRA-HERNANDEZ N. DIMOPOULOS Departmet of Electrical ad Computer Eg. Uiversity of Victoria Victoria, B.C. CANADA Abstract: -
More informationWhat are we going to learn? CSC Data Structures Analysis of Algorithms. Overview. Algorithm, and Inputs
What are we goig to lear? CSC316-003 Data Structures Aalysis of Algorithms Computer Sciece North Carolia State Uiversity Need to say that some algorithms are better tha others Criteria for evaluatio Structure
More informationEE University of Minnesota. Midterm Exam #1. Prof. Matthew O'Keefe TA: Eric Seppanen. Department of Electrical and Computer Engineering
EE 4363 1 Uiversity of Miesota Midterm Exam #1 Prof. Matthew O'Keefe TA: Eric Seppae Departmet of Electrical ad Computer Egieerig Uiversity of Miesota Twi Cities Campus EE 4363 Itroductio to Microprocessors
More informationEM375 STATISTICS AND MEASUREMENT UNCERTAINTY LEAST SQUARES LINEAR REGRESSION ANALYSIS
EM375 STATISTICS AND MEASUREMENT UNCERTAINTY LEAST SQUARES LINEAR REGRESSION ANALYSIS I this uit of the course we ivestigate fittig a straight lie to measured (x, y) data pairs. The equatio we wat to fit
More informationCMSC Computer Architecture Lecture 12: Virtual Memory. Prof. Yanjing Li University of Chicago
CMSC 22200 Computer Architecture Lecture 12: Virtual Memory Prof. Yajig Li Uiversity of Chicago A System with Physical Memory Oly Examples: most Cray machies early PCs Memory early all embedded systems
More informationA Path Planning Method for Robotic Belt Surface Grinding
Chiese Joural of Aeroautics 24 (2011) 520-526 Cotets lists available at ScieceDirect Chiese Joural of Aeroautics joural homepage: www.elsevier.com/locate/cja A Path Plaig Method for Robotic Belt Surface
More informationExamples and Applications of Binary Search
Toy Gog ITEE Uiersity of Queeslad I the secod lecture last week we studied the biary search algorithm that soles the problem of determiig if a particular alue appears i a sorted list of iteger or ot. We
More informationArithmetic Sequences
. Arithmetic Sequeces COMMON CORE Learig Stadards HSF-IF.A. HSF-BF.A.1a HSF-BF.A. HSF-LE.A. Essetial Questio How ca you use a arithmetic sequece to describe a patter? A arithmetic sequece is a ordered
More informationLecture Notes 6 Introduction to algorithm analysis CSS 501 Data Structures and Object-Oriented Programming
Lecture Notes 6 Itroductio to algorithm aalysis CSS 501 Data Structures ad Object-Orieted Programmig Readig for this lecture: Carrao, Chapter 10 To be covered i this lecture: Itroductio to algorithm aalysis
More informationCSE 417: Algorithms and Computational Complexity
Time CSE 47: Algorithms ad Computatioal Readig assigmet Read Chapter of The ALGORITHM Desig Maual Aalysis & Sortig Autum 00 Paul Beame aalysis Problem size Worst-case complexity: max # steps algorithm
More informationOur second algorithm. Comp 135 Machine Learning Computer Science Tufts University. Decision Trees. Decision Trees. Decision Trees.
Comp 135 Machie Learig Computer Sciece Tufts Uiversity Fall 2017 Roi Khardo Some of these slides were adapted from previous slides by Carla Brodley Our secod algorithm Let s look at a simple dataset for
More informationCh 9.3 Geometric Sequences and Series Lessons
Ch 9.3 Geometric Sequeces ad Series Lessos SKILLS OBJECTIVES Recogize a geometric sequece. Fid the geeral, th term of a geometric sequece. Evaluate a fiite geometric series. Evaluate a ifiite geometric
More informationComputer Science Foundation Exam. August 12, Computer Science. Section 1A. No Calculators! KEY. Solutions and Grading Criteria.
Computer Sciece Foudatio Exam August, 005 Computer Sciece Sectio A No Calculators! Name: SSN: KEY Solutios ad Gradig Criteria Score: 50 I this sectio of the exam, there are four (4) problems. You must
More informationOptimization for framework design of new product introduction management system Ma Ying, Wu Hongcui
2d Iteratioal Coferece o Electrical, Computer Egieerig ad Electroics (ICECEE 2015) Optimizatio for framework desig of ew product itroductio maagemet system Ma Yig, Wu Hogcui Tiaji Electroic Iformatio Vocatioal
More informationAdministrative UNSUPERVISED LEARNING. Unsupervised learning. Supervised learning 11/25/13. Final project. No office hours today
Admiistrative Fial project No office hours today UNSUPERVISED LEARNING David Kauchak CS 451 Fall 2013 Supervised learig Usupervised learig label label 1 label 3 model/ predictor label 4 label 5 Supervised
More informationBASED ON ITERATIVE ERROR-CORRECTION
A COHPARISO OF CRYPTAALYTIC PRICIPLES BASED O ITERATIVE ERROR-CORRECTIO Miodrag J. MihaljeviC ad Jova Dj. GoliC Istitute of Applied Mathematics ad Electroics. Belgrade School of Electrical Egieerig. Uiversity
More informationAn Approach to Develop a Dynamic Job Shop Scheduling by Fuzzy Rule Based System and Comparative Study with the Traditional Priority Rules
America Joural of Egieerig ad Applied Scieces Origial Research Paper A Approach to Develop a Dyamic Job Shop Schedulig by Fuzzy Rule Based System ad Comparative Study with the Traditioal Priority Rules
More informationChapter 3 Classification of FFT Processor Algorithms
Chapter Classificatio of FFT Processor Algorithms The computatioal complexity of the Discrete Fourier trasform (DFT) is very high. It requires () 2 complex multiplicatios ad () complex additios [5]. As
More informationAvid Interplay Bundle
Avid Iterplay Budle Versio 2.5 Cofigurator ReadMe Overview This documet provides a overview of Iterplay Budle v2.5 ad describes how to ru the Iterplay Budle cofiguratio tool. Iterplay Budle v2.5 refers
More informationIntro to Scientific Computing: Solutions
Itro to Scietific Computig: Solutios Dr. David M. Goulet. How may steps does it take to separate 3 objects ito groups of 4? We start with 5 objects ad apply 3 steps of the algorithm to reduce the pile
More informationCSC165H1 Worksheet: Tutorial 8 Algorithm analysis (SOLUTIONS)
CSC165H1, Witer 018 Learig Objectives By the ed of this worksheet, you will: Aalyse the ruig time of fuctios cotaiig ested loops. 1. Nested loop variatios. Each of the followig fuctios takes as iput a
More informationRedundancy Allocation for Series Parallel Systems with Multiple Constraints and Sensitivity Analysis
IOSR Joural of Egieerig Redudacy Allocatio for Series Parallel Systems with Multiple Costraits ad Sesitivity Aalysis S. V. Suresh Babu, D.Maheswar 2, G. Ragaath 3 Y.Viaya Kumar d G.Sakaraiah e (Mechaical
More information