A Multi Due Date Batch Scheduling Model. on Dynamic Flow Shop to Minimize. Total Production Cost
|
|
- Mae Manning
- 7 years ago
- Views:
Transcription
1 Conteporary Enneern Scences, Vol. 9, 2016, no. 7, HIKARI Ltd, A Mult Due Date Batch Scheduln Model on Dynac Flow Shop to Mnze Total Producton Cost Tenku Nuranun * Departent of Industral Enneern, Unverstas Isla Neer Sultan Syarf Kas (UIN Suska) 28293, Pekanbaru, Rau Indonesa * Correspondn author Ahad Fudhol Solar Enery Research Insttute, Unverst Kebansaan Malaysa Ban Selanor, Malaysa Msra Hartat Departent of Industral Enneern, Unverstas Isla Neer Sultan Syarf Kas (UIN Suska) 28293, Pekanbaru, Rau Indonesa Rado Yendra Departent of Matheatcs, Faculty of Scence and Technoloy Unverstas Isla Neer Sultan Syarf Kas (UIN Suska) 28293, Pekanbaru, Rau Indonesa Isu Kusuanto Departent of Industral Enneern, Unverstas Isla Neer Sultan Syarf Kas (UIN Suska) 28293, Pekanbaru, Rau Indonesa Copyrht 2016 Tenku Nuranun et al. Ths artcle s dstrbuted under the Creatve Coons Attrbuton Lcense, whch perts unrestrcted use, dstrbuton, and reproducton n any edu, provded the ornal work s properly cted.
2 316 Tenku Nuranun et al. Abstract Ths research solved a batch scheduln proble on dynac flow shop envronent, n whch new orders are consdered to nsert n the current work. Decson akn s ade by coparn the total cost of the nserton schedule wth the ornal schedule. Another feature of ths odel s ts ablty to accoodate ult product orders that are delvered on dfferent due dates n whch revsed due date s allowed for each order. The proposed odel s known as Mx Inteer Non Lnear Proran (MINLP) wth a convex objectve functon. An alorth s developed to fnd the best solutons of batch sze and sequence that nze total cost. A nuercal experence s perfored to show how the alorth works. Keywords: Batch scheduln, dynac flow shop, ult due dates, ult products, total cost 1 Introducton Batch scheduln has proven as an effectve way to ncrease the anufacturn perforance. Many lteratures have dealt that cobnaton of batch sze, and sequences are relable n nzn cost or te lenth producton. Nowadays, uncertan envronent poses a copany to the response all possbltes of chann rapdly. Dsturbances ht be caused by varous factors such as dsrupted achne, arrval of new orders, cancellaton of current orders, updatn due dates, and others. Scheduln research has ostly focused on nventn a odel or alorth to solve deternstc probles. In recent decades, further research has been developed to solve dynac and uncertan envronents [1-5]. In ost real producton envronents, jobs arrve to the syste randoly, and the job's arrval and release dates are not known n advance. A sple approach of ths condton s nsertn the new jobs nto the scheduled sequence. Several works have been done to arrane the latest order to the executed schedule by desnn the nserton technque [6, 7]. Ths stuaton akes a devaton fro ornal schedule and potentally ncreases the total of producton cost. Coon resource that s used for dfferent jobs also ncreases the coplexty of proble and becoes ore dffcult to fure t. In fact, copletn all jobs on ther due dates has becoe a coplex ssue n a way of ncreasn servce level to the custoer. Further, n dynac stuaton, both WIP and new orders need to eet due date. Each job has ts release date that s sorely portant to be accoplshed. Very lttle work s reported on the cost effect of new order's arrval [8, 9]. Earler copleton te arses consequence to the holdn cost, n contrast, later copleton te effects at the penalty cost. Hence, trade off aon varous costs are needed n akn decson, whether contnun the current schedule or adjustn the ornal schedule wth all dynac stuatons. Ths paper s aed to develop a ore flexble odel and technque to accoodate new orders wth acceptable cost consequence. The odel has consdered setup cost, WIP cost, nventory cost, and lost sale cost. All jobs are
3 A ult due date batch scheduln odel 317 processed on the sae routn but ht be dfferent n specfcaton (ult te). Each job has ts due date (ult due date) and possble to revse t. An adaptve jobnserton based heurstc s presented to deterne batch sze and schedule the resultn batches wth the objectve to nze total producton cost. 2 Total producton cost There are four eleents of producton cost that are consdered n ths odel, they are set up cost, work-n-process (WIP) cost, nventory cost, and lost sale cost. Suppose that there are n jobs of te to be process on stae, each stae conssts of snle achne. Jobs are batched nto N batches wth batch sze Q ( = 1, 2,..., N). All jobs that are processed n the sae batch only need a snle setup before processn. The setup te on a achne s denoted as s, and setup cost of a achne s denoted as C1,, then setup cost s forulated by ultplyn setup te wth setup cost. Thus, total setup cost can be wrtten as follows: M TC N s C (1) 1, 1, 1 Interedate processn s defned as te lenth of a batch to be processed. If F s the fnshn te of a batch on achne, and B1 s the startn te of a batch on achne 1, then WIP s calculated as a devaton between the fnshn te and the startn te. Mnzn WIP cost wll also nze the te lenth producton sultaneously. If Interedate cost of te s denoted as C2, then forulaton of total WIP cost can be seen as follows: N TC2, r, F B1 Q C2, (2) 1 1 Ths odel has consdered about real te condton where each te has specfc due date. If the shop capacty s tht, t s dffcult to eet all due dates but earler fnshed oods are pertted. Ths condton ay ncur an nventory cost untl the products are released. If holdn cost of te s denoted as C3,, then we can calculate total fnshed oods nventory cost as follows: N (3) TC 3, 1 1 r d F M Q C 3, In ths forulaton, a job s not allowed to delver after ts due date. If jobs are possble to be fnshed on ther due date, then they wll not be processed on the shop floor. It eans the copany wll lose ther opportunty to delver the products and caused the lost sale cost as penalty. In case the arrval of a new job, odel wll copare nventory cost f the products are fnshed earler, and lost sale cost f the products are refused to be process. Due date can be rearraned wth the custoer based on the feasblty of the odel. It clearly asssts the decson aker n dealn wth the custoer edately. The result of ths consderaton s yes or no decson. It wll nvolve a Bnner varable, X, n whch the varable value s 1 f the new order s accepted or the varable value s 0 f the new order s rejected. If lost sale cost of te s denoted as C4,, then total lost sale cost s forulated as follows:
4 318 Tenku Nuranun et al. TC 4, 1 X C 4, (4) achne M1 L 11 Earlness M2 L 12 s 2 te In Process Batch B 1,1 F 1,2 d F. 1 Producton cost 3 Proble forulatons The varables that are nvolved n ths odel forulaton can be denoted as below: B : Startn te for batch, whch s sequenced n poston on achne F : Fnshn te for batch, whch s sequenced n poston on achne Q : Batch sze whch s sequenced n poston N : The nuber of batches r : Bnner varable for te wthn batch whch s sequenced n poston X : Bnner varable for arrval of new order TC : Total Producton Cost The paraeters that are used n ths proposed odel can be defned as follows: M : The nuber of achnes : The nuber of te n : The nuber of te to be requested on d d : Due date of te t : The processn te for te processed on achne s : The setup te requred before any batch s processed on achne A : Avalablty of achne C1, : Setup cost for achne C2, : Interedate cost for te C3, : Holdn Cost of te There are n jobs of te ( = 1, 2,... ) that are requested to be processed on a staes flow shop, each stae consst of a snle achne, whch s each te wll be delvered on ts due date, d1, d2,..., d. All tes have the sae routn but dfferent n specfcaton, e.. colour, sze, etc., All varant tes wll be processed n batches,
5 A ult due date batch scheduln odel 319 and setup te s requred before any batch enters a achne. The proble s deternn batch szes and sequences that nze total producton cost sultaneously. Ths odel has accoodated arrval of new orders, so that a varable to check avalablty of achne s needed. The functon of ths varable wll be clearly explaned n proposed alorth. The odel s developed under several assuptons: Holdn cost of raw ateral s nelble. Setup te and setup cost for all batches that are processed on the sae achne s fxed. The arrval of a new job s not pertted to nterrupt the current work. None of the batches that s processed on ore than one achne, and none of achnes that run the process for ore than one batch. The objectve of the developed odel s to nze total producton cost. It conssts of several cost eleents, and we need the trade-off between the cost varables as the result. Thus, the forulaton of total producton cost s: TC N M s C N r 1, N 1 1 r F B 1 d F, M Q C3, 1 Q C X 2, C 4, Where, B1,1 A1 s1 (6) FN, M d (14) F1,1 B1,1 r1, t,1 Q1 (7) r, 0,1 (15) B 1 ; 1,, N ; 1,, F 1,1 s1 ; 2, N (8) r 1 ; 1, N, 1, t Q ; 2, N F, 1 B1 r,,1, B 1 ax F, 1, 1 A ; 2, M (10) 1,, 1 F t Q ; 2, M F1, B1, r1,, 1,,, 1 (9) r, Q n ; 1,, N B ax 1, F 1, s (12) 1, nteer ; 2,, N ; 2,, M F B t Q ; 2,, N ; 2,, M r 1, 1 N 1, f r, 0 ; 1,, X 1 0, else (16) (17) (18) (11) N (19) (13) Q (20) Constrant (6) and (7) show the bennn and fnshn te of the frst batch on achne 1. Constrant (8) and (9) show the bennn and fnshn te of batch that s sequenced on achne 1. Constrant (10) and (11) show the bennn and fnshn te of the frst batch on achne. Constrant (12) and (13) shows the bennn and fnshn te of batch that s sequenced on achne. Constrant (14) to ake sure that fnshn te of all products s earler or precsely on ther due dates. Constrant (15) s a Bnner varable to deterne the partcular te that (5)
6 320 Tenku Nuranun et al. s placed n batch where s sequenced on poston. Constrant (17) verfes the total of jobs that are processed n a batch equal wth the order nuber. Constrant (18) s a Bnner varable to deterne the new order, whether accepted or rejected t. Constrant (19) shows that the nuber of batch s equal or ore than the nuber of te. Constrant (20) s avalable to ake sure that the nuber of a batch s ore than 1 and nteer. 4 Proble soluton Ths paper has consdered about the arrval of new orders n the flow shop. An alorth s proposed to et the soluton of ths proble. There are two alorths developed for ths proble. Frstly, we wll ntroduce an alorth to nsert a new order to the exstn schedule. Secondly, we wll show an alorth to splt jobs nto batches. In eneral, we can explan the dea of the dynac flow shop alorth as below: Check the avalablty of achnes to perfor the new order by re-count the nuber of jobs and reann te needed for unfnshed works and deterne the ost possble pont of te perod to ben the arrval order. roup the new work that s dentcal wth the current works and calculate the total nuber of revsed order n a roup. Re-schedule. Further, these are the detals of the proposed alorth to solve the proble: a. Insertn New Order Alorth Step 1. Identfy the current works that are processn on the shop floor. Step 2. Set the fnshn te of current works on all achnes as the avalablty of achne (A). Step 3. Check the reann works that have not been processed yet and roup the wth the slar new orders. Step 4. Splt the roup based on due dates. If a roup has several dfferent due dates, re-roup the nto due dates. Step 5. Set the value of predeterned paraeters that are needed n calculaton. Step 6. Set the nuber of batch equal wth the nuber of te. Step 7. Solve the proble usn the proposed odel. Step 8. Splt the batch usn Sub Alorth for Batchn and Sequencn. Step 9. Use the result as revsed schedule. Step 10. Check the status of all new orders. If entre works are rejected, then back to the ntal schedule. If at least one of the new orders s accepted, then use the revsed schedule. Step 11. Fnsh. b. Sub Alorth for Batchn and Sequencn Step 1. Set N = + 1. Step 2. Solve the proble of batchn and sequencn usn the forulaton. Step 3. Note the result of total producton cost. Step 4. Check feasblty of schedule based on due date of each order. Stop searchn f t s not feasble, then o to Step 7. Otherwse, o to Step 5.
7 Total Cost A ult due date batch scheduln odel 321 Step 5. Check the nuber of batch. If t has reached the nuber of te, then o to Step 7. Otherwse, o to Step 6. Step 6. Set N = N + 1. Back to Step 2. Step 7. Use the schedule wth nu total producton cost as the result. Step 8. Fnsh. 5 Nuercal Experence There are two knds of products that wll be processed on three staes flow shop, product A and product B. The values of the paraeters as shown n Table 1 and Table 2. Ths stuaton presented deternstc crcustance wthout dsturbances that ay nterrupt the process. The result of ths proble s stated as the ornal schedule, can be seen as shown n Table 3. Table 1 Paraeters for achnes t A B s C1, Table 2 Paraeters for products Product n d C2, C3, A B Table 3 The resultn batch for statc envronent N TC N TC The soluton shows that the relaton between total producton cost and batch sze s convex. Splttn batch nto sall sze wll reduce the total producton cost untl the nu pont s reached and after that the nuber of batch wll ncrease the total producton cost, as shown n F.2. The ornal schedule of ths proble s perfored as shown n Table The Nuber of Batches F. 2 Total producton cost for dfferent batch sze
8 322 Tenku Nuranun et al. Table 4 The ornal schedule Startn N Q Ite Pont F M B 1 1 A A A B B B contnued 7 1 B B B B B B B For dynac stuaton, suppose that there s an order of eht unts te B arrves at 154 of te perod and needed to delver on 450 of the te perod. The proposed alorth wll be used to solve ths stuaton. Step 1. The current work that are processn on the shop floor at nute 154 s Q7 on the achne-3. Step 2. The avalabltes of achne are A1 = 58, A2 = 154, and A3 = 164. Step 3. The reann work that have not been fnshed to process s te B, slar type wth the new order. Step 4. Due date of the new order s thter than the current work. Then, to dffer t, the new order wll be labelled as te C. Step 5. Set the value of predeterned paraeters that are needed n calculaton. Step 6. Set N = 2 Step 7. The resultn value of total producton cost for N = 2 are showed n Table 5. Step 8. The resultn batch s presented on Table 5. Step 9. The resultn schedule s presented on Table 6. Step 10. Check the status of all new orders. If entre works are rejected, then back to the ntal schedule. If at least one of the new orders s accepted, then use the revsed schedule. Step 11. Fnsh.
9 Total Cost A ult due date batch scheduln odel 323 The raph to show the convex objectve functon for dynac flow shop envronent as shown n F.3. Table 5 The resultn batch for dynac envronent N TC N TC The Nuber of Batches F.3 Total producton cost for dynac envronent Table 6. The revsed schedule Startn N Q Ite Pont F B 1 2 C B C C B B C B C Conclusons Ths paper addresses a ult due date batch scheduln odel on dynac crcustance for slar steps of the producton process to nze total producton cost. There are several cost eleents that s consdered n the proposed odel, they are setup cost, work-n-process (WIP) cost, nventory cost, and lost sale cost. Nuercal experence shows that the proposed odel and alorth are relable to solve the dynac scheduln proble for flow shop anufacturn. Future research as developent of ths odel and alorth s needed to solve the
10 324 Tenku Nuranun et al. ore coplex stuaton, e.. nvolvn penalty cost for the late fnshed jobs, consdern another dsturbance stuaton lke unavalablty of achnes, etc. References [1] D. Ouelhadj and S. Petrovc, A Survey of dynac scheduln n anufacturn systes, Journal of Scheduln, 12 (2009), no. 4, [2] M. hola M. Zandeh and A.A. Tabrz, Scheduln hybrd flow shop wth sequence-dependent setup tes and achnes wth rando breakdowns, The Internatonal Journal of Advanced Manufacturn Technoloy 42 (2009), no. 1-2, [3] L. Tan, W. Lu and J. Lu, A neural network odel and alorth for the hybrd flow shop scheduln proble n a dynac envronent, Journal of Intellent Manufacturn 16 (2005), no. 3, [4] S.Q. Lu, H.L. On and K.M. N, Metaheurstcs for nzn the akespan of the dynac shop scheduln proble, Advances n Enneern Software, 36 (2005), no. 3, [5] R. Aoune, Mnzn the akespan for the flow shop scheduln proble wth avalablty constrants, European Journal of Operatonal Research, 153 (2004), no. 3, [6]. uo, B. Wu and S. Yan, A job-nserton heurstc for nzn the ean flowte n dynac flowshops, Front. Mech. En., 6 (2011), no. 2, [7] E. Lodree, W. Jan and C.M. Klen, A new rule for nzn the nuber of tardy jobs n dynac flow shops, European Journal of Operatonal Research, 159 (2004), no. 1, [8] K. Bulbul, P. Kansky and C. Yano, Flow shop scheduln wth earlness, tardness, and nteredate nventory holdn costs, Naval Research Lostcs (NRL), 51 (2004), [9] A.H. Hal and H. Ohta, Batch-scheduln probles to nze nventory cost n the shop wth both recevn and delvery just-n-tes, Internatonal Journal of Producton Econocs, 33 (1994), Receved: February 12, 2016; Publshed: March 24, 2016
An Electricity Trade Model for Microgrid Communities in Smart Grid
An Electrcty Trade Model for Mcrogrd Countes n Sart Grd Tansong Cu, Yanzh Wang, Shahn Nazaran and Massoud Pedra Unversty of Southern Calforna Departent of Electrcal Engneerng Los Angeles, CA, USA {tcu,
More informationPower-of-Two Policies for Single- Warehouse Multi-Retailer Inventory Systems with Order Frequency Discounts
Power-of-wo Polces for Sngle- Warehouse Mult-Retaler Inventory Systems wth Order Frequency Dscounts José A. Ventura Pennsylvana State Unversty (USA) Yale. Herer echnon Israel Insttute of echnology (Israel)
More informationII. THE QUALITY AND REGULATION OF THE DISTRIBUTION COMPANIES I. INTRODUCTION
Fronter Methodology to fx Qualty goals n Electrcal Energy Dstrbuton Copanes R. Rarez 1, A. Sudrà 2, A. Super 3, J.Bergas 4, R.Vllafáfla 5 1-2 -3-4-5 - CITCEA - UPC UPC., Unversdad Poltécnca de Cataluña,
More informationGanesh Subramaniam. American Solutions Inc., 100 Commerce Dr Suite # 103, Newark, DE 19713, USA
238 Int. J. Sulaton and Process Modellng, Vol. 3, No. 4, 2007 Sulaton-based optsaton for ateral dspatchng n Vendor-Managed Inventory systes Ganesh Subraana Aercan Solutons Inc., 100 Coerce Dr Sute # 103,
More informationFault tolerance in cloud technologies presented as a service
Internatonal Scentfc Conference Computer Scence 2015 Pavel Dzhunev, PhD student Fault tolerance n cloud technologes presented as a servce INTRODUCTION Improvements n technques for vrtualzaton and performance
More informationA Fuzzy Optimization Framework for COTS Products Selection of Modular Software Systems
Internatonal Journal of Fuy Systes, Vol. 5, No., June 0 9 A Fuy Optaton Fraework for COTS Products Selecton of Modular Software Systes Pankaj Gupta, Hoang Pha, Mukesh Kuar Mehlawat, and Shlp Vera Abstract
More informationStochastic Models of Load Balancing and Scheduling in Cloud Computing Clusters
Stochastc Models of Load Balancng and Schedulng n Cloud Coputng Clusters Sva Theja Magulur and R. Srkant Departent of ECE and CSL Unversty of Illnos at Urbana-Chapagn sva.theja@gal.co; rsrkant@llnos.edu
More informationInventory Control in a Multi-Supplier System
3th Intl Workng Senar on Producton Econocs (WSPE), Igls, Autrche, pp.5-6 Inventory Control n a Mult-Suppler Syste Yasen Arda and Jean-Claude Hennet LAAS-CRS, 7 Avenue du Colonel Roche, 3077 Toulouse Cedex
More informationStochastic Models of Load Balancing and Scheduling in Cloud Computing Clusters
Stochastc Models of Load Balancng and Schedulng n Cloud Coputng Clusters Sva Theja Magulur and R. Srkant Departent of ECE and CSL Unversty of Illnos at Urbana-Chapagn sva.theja@gal.co; rsrkant@llnos.edu
More informationStochastic Models of Load Balancing and Scheduling in Cloud Computing Clusters
01 Proceedngs IEEE INFOCOM Stochastc Models of Load Balancng and Schedulng n Cloud Coputng Clusters Sva heja Magulur and R. Srkant Departent of ECE and CSL Unversty of Illnos at Urbana-Chapagn sva.theja@gal.co;
More informationBANDWIDTH ALLOCATION AND PRICING PROBLEM FOR A DUOPOLY MARKET
Yugoslav Journal of Operatons Research (0), Nuber, 65-78 DOI: 0.98/YJOR0065Y BANDWIDTH ALLOCATION AND PRICING PROBLEM FOR A DUOPOLY MARKET Peng-Sheng YOU Graduate Insttute of Marketng and Logstcs/Transportaton,
More informationTwo-Phase Traceback of DDoS Attacks with Overlay Network
4th Internatonal Conference on Sensors, Measureent and Intellgent Materals (ICSMIM 205) Two-Phase Traceback of DDoS Attacks wth Overlay Network Zahong Zhou, a, Jang Wang2, b and X Chen3, c -2 School of
More informationA R T I C L E S DYNAMIC VEHICLE DISPATCHING: OPTIMAL HEAVY TRAFFIC PERFORMANCE AND PRACTICAL INSIGHTS
A R T I C L E S DYAMIC VEHICLE DISPATCHIG: OPTIMAL HEAVY TRAFFIC PERFORMACE AD PRACTICAL ISIGHTS OAH GAS OPIM Departent, The Wharton School, Unversty of Pennsylvana, Phladelpha, Pennsylvana 19104-6366
More informationDynamic Resource Allocation in Clouds: Smart Placement with Live Migration
Dynac Resource Allocaton n Clouds: Sart Placeent wth Lve Mgraton Mahlouf Had Ingéneur de Recherche ahlouf.had@rt-systex.fr Avec : Daal Zeghlache (TSP) daal.zeghlache@teleco-sudpars.eu FONDATION DE COOPERATION
More informationCapacity Planning for Virtualized Servers
Capacty Plannng for Vrtualzed Servers Martn Bchler, Thoas Setzer, Benjan Spetkap Departent of Inforatcs, TU München 85748 Garchng/Munch, Gerany (bchler setzer benjan.spetkap)@n.tu.de Abstract Today's data
More informationbenefit is 2, paid if the policyholder dies within the year, and probability of death within the year is ).
REVIEW OF RISK MANAGEMENT CONCEPTS LOSS DISTRIBUTIONS AND INSURANCE Loss and nsurance: When someone s subject to the rsk of ncurrng a fnancal loss, the loss s generally modeled usng a random varable or
More informationNaglaa Raga Said Assistant Professor of Operations. Egypt.
Volue, Issue, Deceer ISSN: 77 8X Internatonal Journal of Adanced Research n Coputer Scence and Software Engneerng Research Paper Aalale onlne at: www.jarcsse.co Optal Control Theory Approach to Sole Constraned
More informationA Novel Dynamic Role-Based Access Control Scheme in User Hierarchy
Journal of Coputatonal Inforaton Systes 6:7(200) 2423-2430 Avalable at http://www.jofcs.co A Novel Dynac Role-Based Access Control Schee n User Herarchy Xuxa TIAN, Zhongqn BI, Janpng XU, Dang LIU School
More informationBasic Queueing Theory M/M/* Queues. Introduction
Basc Queueng Theory M/M/* Queues These sldes are created by Dr. Yh Huang of George Mason Unversty. Students regstered n Dr. Huang's courses at GMU can ake a sngle achne-readable copy and prnt a sngle copy
More informationVirtual machine resource allocation algorithm in cloud environment
COMPUTE MOELLIN & NEW TECHNOLOIES 2014 1(11) 279-24 Le Zheng Vrtual achne resource allocaton algorth n cloud envronent 1, 2 Le Zheng 1 School of Inforaton Engneerng, Shandong Youth Unversty of Poltcal
More informationRevenue Maximization Using Adaptive Resource Provisioning in Cloud Computing Environments
202 ACM/EEE 3th nternatonal Conference on Grd Coputng evenue Maxzaton sng Adaptve esource Provsonng n Cloud Coputng Envronents Guofu Feng School of nforaton Scence, Nanng Audt nversty, Nanng, Chna nufgf@gal.co
More informationHow Much to Bet on Video Poker
How Much to Bet on Vdeo Poker Trstan Barnett A queston that arses whenever a gae s favorable to the player s how uch to wager on each event? Whle conservatve play (or nu bet nzes large fluctuatons, t lacks
More informationResource Management For Workflows In Cloud Computing Environment Based On Group Technology Approach
Proceedns of the 2015 Internatonal Conference on Industral Enneern and Oeratons Manaeent Duba, Unted Arab Erates (UAE), March 3 5, 2015 Resource Manaeent For Worflows In Cloud Coutn Envronent Based On
More informationInternational Journal of Industrial Engineering Computations
Internatonal Journal of Industral ngneerng Coputatons 3 (2012) 393 402 Contents lsts avalable at GrowngScence Internatonal Journal of Industral ngneerng Coputatons hoepage: www.growngscence.co/jec Suppler
More information2008/8. An integrated model for warehouse and inventory planning. Géraldine Strack and Yves Pochet
2008/8 An ntegrated model for warehouse and nventory plannng Géraldne Strack and Yves Pochet CORE Voe du Roman Pays 34 B-1348 Louvan-la-Neuve, Belgum. Tel (32 10) 47 43 04 Fax (32 10) 47 43 01 E-mal: corestat-lbrary@uclouvan.be
More informationRobust Design of Public Storage Warehouses. Yeming (Yale) Gong EMLYON Business School
Robust Desgn of Publc Storage Warehouses Yemng (Yale) Gong EMLYON Busness School Rene de Koster Rotterdam school of management, Erasmus Unversty Abstract We apply robust optmzaton and revenue management
More informationProject Networks With Mixed-Time Constraints
Project Networs Wth Mxed-Tme Constrants L Caccetta and B Wattananon Western Australan Centre of Excellence n Industral Optmsaton (WACEIO) Curtn Unversty of Technology GPO Box U1987 Perth Western Australa
More informationAn MILP model for planning of batch plants operating in a campaign-mode
An MILP model for plannng of batch plants operatng n a campagn-mode Yanna Fumero Insttuto de Desarrollo y Dseño CONICET UTN yfumero@santafe-concet.gov.ar Gabrela Corsano Insttuto de Desarrollo y Dseño
More informationINVENTORY CONTROL FOR HIGH TECHNOLOGY CAPITAL EQUIPMENT FIRMS. Hari Shreeram Abhyankar. B.S. Mathematics B.S. Economics Purdue University.
INVENTORY CONTRO FOR IG TECNOOGY CAPITA EQUIPMENT FIRM by ar hreera Abhyankar B.. Matheatcs B.. Econocs Purdue Unversty. 99 M.. Industral Engneerng Purdue Unversty. 994 ubtted to the loan chool of Manageent
More informationInstitute of Informatics, Faculty of Business and Management, Brno University of Technology,Czech Republic
Lagrange Multplers as Quanttatve Indcators n Economcs Ivan Mezník Insttute of Informatcs, Faculty of Busness and Management, Brno Unversty of TechnologCzech Republc Abstract The quanttatve role of Lagrange
More informationBatch Scheduling for a Single Deteriorating Machine to Minimize Total Actual Flow Time
Proceedngs of the 2014 Internatonal Conference on Industral Engneerng and Operatons Management Bal, Indonesa, January 7 9, 2014 Batch Schedulng for a Sngle Deteroratng Machne to Mnmze Total Actual Flow
More informationJ. Parallel Distrib. Comput.
J. Parallel Dstrb. Comput. 71 (2011) 62 76 Contents lsts avalable at ScenceDrect J. Parallel Dstrb. Comput. journal homepage: www.elsever.com/locate/jpdc Optmzng server placement n dstrbuted systems n
More informationTourism Demand Forecasting by Improved SVR Model
Internatonal Journal of u- and e- Servce, Scence and Technology, pp403-4 http://dxdoorg/0457/junesst058538 Tours Deand Forecastng by Iproved SVR Model L Me Departent of Socal Servces,Zhengzhou Tours College,Henan,PRChna
More informationOnline Algorithms for Uploading Deferrable Big Data to The Cloud
Onlne lgorths for Uploadng Deferrable Bg Data to The Cloud Lnquan Zhang, Zongpeng L, Chuan Wu, Mnghua Chen Unversty of Calgary, {lnqzhan,zongpeng}@ucalgary.ca The Unversty of Hong Kong, cwu@cs.hku.hk The
More informationA method for a robust optimization of joint product and supply chain design
DOI 10.1007/s10845-014-0908-5 A method for a robust optmzaton of jont product and supply chan desgn Bertrand Baud-Lavgne Samuel Bassetto Bruno Agard Receved: 10 September 2013 / Accepted: 21 March 2014
More informationResearch Article Enhanced Two-Step Method via Relaxed Order of α-satisfactory Degrees for Fuzzy Multiobjective Optimization
Hndaw Publshng Corporaton Mathematcal Problems n Engneerng Artcle ID 867836 pages http://dxdoorg/055/204/867836 Research Artcle Enhanced Two-Step Method va Relaxed Order of α-satsfactory Degrees for Fuzzy
More informationExtending Probabilistic Dynamic Epistemic Logic
Extendng Probablstc Dynamc Epstemc Logc Joshua Sack May 29, 2008 Probablty Space Defnton A probablty space s a tuple (S, A, µ), where 1 S s a set called the sample space. 2 A P(S) s a σ-algebra: a set
More informationCONSTRUCTION OF A COLLABORATIVE VALUE CHAIN IN CLOUD COMPUTING ENVIRONMENT
CONSTRUCTION OF A COLLAORATIVE VALUE CHAIN IN CLOUD COMPUTING ENVIRONMENT Png Wang, School of Econoy and Manageent, Jangsu Unversty of Scence and Technology, Zhenjang Jangsu Chna, sdwangp1975@163.co Zhyng
More informationDynamic Fleet Management for Cybercars
Proceedngs of the IEEE ITSC 2006 2006 IEEE Intellgent Transportaton Systems Conference Toronto, Canada, September 17-20, 2006 TC7.5 Dynamc Fleet Management for Cybercars Fenghu. Wang, Mng. Yang, Ruqng.
More informationResearch Article Load Balancing for Future Internet: An Approach Based on Game Theory
Appled Matheatcs, Artcle ID 959782, 11 pages http://dx.do.org/10.1155/2014/959782 Research Artcle Load Balancng for Future Internet: An Approach Based on Gae Theory Shaoy Song, Tngje Lv, and Xa Chen School
More informationSupply chain management services sharing in headquarterscentered
Ttle Supply chan anageent servces sharng n headquarterscentered group copanes Advsor(s) Huang, GQ Author(s) Zhang, Tng; 张 婷 Ctaton Issued Date 204 URL http://hdl.handle.net/0722/206755 Rghts The author
More informationAn Enhanced K-Anonymity Model against Homogeneity Attack
JOURNAL OF SOFTWARE, VOL. 6, NO. 10, OCTOBER 011 1945 An Enhanced K-Anont Model aganst Hoogenet Attack Qan Wang College of Coputer Scence of Chongqng Unverst, Chongqng, Chna Eal: wangqan@cqu.edu.cn Zhwe
More informationCan Auto Liability Insurance Purchases Signal Risk Attitude?
Internatonal Journal of Busness and Economcs, 2011, Vol. 10, No. 2, 159-164 Can Auto Lablty Insurance Purchases Sgnal Rsk Atttude? Chu-Shu L Department of Internatonal Busness, Asa Unversty, Tawan Sheng-Chang
More informationAn Analytical Model of Web Server Load Distribution by Applying a Minimum Entropy Strategy
Internatonal Journal of Coputer and Councaton Engneerng, Vol. 2, No. 4, July 203 An Analytcal odel of Web Server Load Dstrbuton by Applyng a nu Entropy Strategy Teeranan Nandhakwang, Settapong alsuwan,
More informationSciences Shenyang, Shenyang, China.
Advanced Materals Research Vols. 314-316 (2011) pp 1315-1320 (2011) Trans Tech Publcatons, Swtzerland do:10.4028/www.scentfc.net/amr.314-316.1315 Solvng the Two-Obectve Shop Schedulng Problem n MTO Manufacturng
More informationSimulation and optimization of supply chains: alternative or complementary approaches?
Smulaton and optmzaton of supply chans: alternatve or complementary approaches? Chrstan Almeder Margaretha Preusser Rchard F. Hartl Orgnally publshed n: OR Spectrum (2009) 31:95 119 DOI 10.1007/s00291-007-0118-z
More informationScan Detection in High-Speed Networks Based on Optimal Dynamic Bit Sharing
Scan Detecton n Hgh-Speed Networks Based on Optal Dynac Bt Sharng Tao L Shgang Chen Wen Luo Mng Zhang Departent of Coputer & Inforaton Scence & Engneerng, Unversty of Florda Abstract Scan detecton s one
More informationQuality of Service Analysis and Control for Wireless Sensor Networks
Qualty of ervce Analyss and Control for Wreless ensor Networs Jaes Kay and Jeff Frol Unversty of Veront ay@uv.edu, frol@eba.uv.edu Abstract hs paper nvestgates wreless sensor networ spatal resoluton as
More informationSUPPLIER FINANCING AND STOCK MANAGEMENT. A JOINT VIEW.
SUPPLIER FINANCING AND STOCK MANAGEMENT. A JOINT VIEW. Lucía Isabel García Cebrán Departamento de Economía y Dreccón de Empresas Unversdad de Zaragoza Gran Vía, 2 50.005 Zaragoza (Span) Phone: 976-76-10-00
More informationElastic Systems for Static Balancing of Robot Arms
. th World ongress n Mechans and Machne Scence, Guanajuato, Méco, 9- June, 0 _ lastc Sstes for Statc alancng of Robot rs I.Sonescu L. uptu Lucana Ionta I.Ion M. ne Poltehnca Unverst Poltehnca Unverst Poltehnca
More informationTo manage leave, meeting institutional requirements and treating individual staff members fairly and consistently.
Corporate Polces & Procedures Human Resources - Document CPP216 Leave Management Frst Produced: Current Verson: Past Revsons: Revew Cycle: Apples From: 09/09/09 26/10/12 09/09/09 3 years Immedately Authorsaton:
More informationThe Greedy Method. Introduction. 0/1 Knapsack Problem
The Greedy Method Introducton We have completed data structures. We now are gong to look at algorthm desgn methods. Often we are lookng at optmzaton problems whose performance s exponental. For an optmzaton
More informationRetailers must constantly strive for excellence in operations; extremely narrow profit margins
Managng a Retaler s Shelf Space, Inventory, and Transportaton Gerard Cachon 300 SH/DH, The Wharton School, Unversty of Pennsylvana, Phladelpha, Pennsylvana 90 cachon@wharton.upenn.edu http://opm.wharton.upenn.edu/cachon/
More informationThe Development of Web Log Mining Based on Improve-K-Means Clustering Analysis
The Development of Web Log Mnng Based on Improve-K-Means Clusterng Analyss TngZhong Wang * College of Informaton Technology, Luoyang Normal Unversty, Luoyang, 471022, Chna wangtngzhong2@sna.cn Abstract.
More informationOmega 39 (2011) 313 322. Contents lists available at ScienceDirect. Omega. journal homepage: www.elsevier.com/locate/omega
Omega 39 (2011) 313 322 Contents lsts avalable at ScenceDrect Omega journal homepage: www.elsever.com/locate/omega Supply chan confguraton for dffuson of new products: An ntegrated optmzaton approach Mehd
More informationSurvey on Virtual Machine Placement Techniques in Cloud Computing Environment
Survey on Vrtual Machne Placement Technques n Cloud Computng Envronment Rajeev Kumar Gupta and R. K. Paterya Department of Computer Scence & Engneerng, MANIT, Bhopal, Inda ABSTRACT In tradtonal data center
More informationDEFINING %COMPLETE IN MICROSOFT PROJECT
CelersSystems DEFINING %COMPLETE IN MICROSOFT PROJECT PREPARED BY James E Aksel, PMP, PMI-SP, MVP For Addtonal Informaton about Earned Value Management Systems and reportng, please contact: CelersSystems,
More informationWhat is Candidate Sampling
What s Canddate Samplng Say we have a multclass or mult label problem where each tranng example ( x, T ) conssts of a context x a small (mult)set of target classes T out of a large unverse L of possble
More informationAn Alternative Way to Measure Private Equity Performance
An Alternatve Way to Measure Prvate Equty Performance Peter Todd Parlux Investment Technology LLC Summary Internal Rate of Return (IRR) s probably the most common way to measure the performance of prvate
More informationFrequency Selective IQ Phase and IQ Amplitude Imbalance Adjustments for OFDM Direct Conversion Transmitters
Frequency Selectve IQ Phase and IQ Ampltude Imbalance Adjustments for OFDM Drect Converson ransmtters Edmund Coersmeer, Ernst Zelnsk Noka, Meesmannstrasse 103, 44807 Bochum, Germany edmund.coersmeer@noka.com,
More informationMarginal Revenue-Based Capacity Management Models and Benchmark 1
Margnal Revenue-Based Capacty Management Models and Benchmark 1 Qwen Wang 2 Guanghua School of Management, Pekng Unversty Sherry Xaoyun Sun 3 Ctgroup ABSTRACT To effcently meet customer requrements, a
More information1. Fundamentals of probability theory 2. Emergence of communication traffic 3. Stochastic & Markovian Processes (SP & MP)
6.3 / -- Communcaton Networks II (Görg) SS20 -- www.comnets.un-bremen.de Communcaton Networks II Contents. Fundamentals of probablty theory 2. Emergence of communcaton traffc 3. Stochastc & Markovan Processes
More information"Research Note" APPLICATION OF CHARGE SIMULATION METHOD TO ELECTRIC FIELD CALCULATION IN THE POWER CABLES *
Iranan Journal of Scence & Technology, Transacton B, Engneerng, ol. 30, No. B6, 789-794 rnted n The Islamc Republc of Iran, 006 Shraz Unversty "Research Note" ALICATION OF CHARGE SIMULATION METHOD TO ELECTRIC
More informationSection 5.3 Annuities, Future Value, and Sinking Funds
Secton 5.3 Annutes, Future Value, and Snkng Funds Ordnary Annutes A sequence of equal payments made at equal perods of tme s called an annuty. The tme between payments s the payment perod, and the tme
More informationOptimal Service Selection Based on Business for Cloud Computing
2013 Internatonal Conference on Cloud and Servce Computn Optmal Servce Selecton Based on Busness for Cloud Computn Xaochen Lu, Chunhe Xa, Zhao We, Xaonn Sun Ben Key Laboratory of Networ Technoloy, School
More informationChapter 4 ECONOMIC DISPATCH AND UNIT COMMITMENT
Chapter 4 ECOOMIC DISATCH AD UIT COMMITMET ITRODUCTIO A power system has several power plants. Each power plant has several generatng unts. At any pont of tme, the total load n the system s met by the
More informationUnconstrained EOQ Analysis of a Furniture Mall - A Case Study of Bellwether Furniture
Internatonal Journal of Scentfc Research n omputer Scence and Engneerng Research Paper Volume-, Issue-5 ISSN: 30-7639 Unconstraned EOQ Analyss of a Furnture Mall - A ase Study of Bellwether Furnture Manmnder
More informationA GENETIC ALGORITHM-BASED METHOD FOR CREATING IMPARTIAL WORK SCHEDULES FOR NURSES
82 Internatonal Journal of Electronc Busness Management, Vol. 0, No. 3, pp. 82-93 (202) A GENETIC ALGORITHM-BASED METHOD FOR CREATING IMPARTIAL WORK SCHEDULES FOR NURSES Feng-Cheng Yang * and We-Tng Wu
More informationMaximizing profit using recommender systems
Maxzng proft usng recoender systes Aparna Das Brown Unversty rovdence, RI aparna@cs.brown.edu Clare Matheu Brown Unversty rovdence, RI clare@cs.brown.edu Danel Rcketts Brown Unversty rovdence, RI danel.bore.rcketts@gal.co
More informationAPPLICATION OF GENETIC ALGORITHM TO STRUCTURAL DYNAMIC PARAMETER IDENTIFICATION
3 th World Conference on Earthquake Enneern Vancouver, B.C., Canada Auust -6, 004 Paper No. 37 APPLICATION OF GENETIC ALGORITHM TO STRUCTURAL DYNAMIC PARAMETER IDENTIFICATION G. S. Wan F. K. Huan and H.
More informationPOLYSA: A Polynomial Algorithm for Non-binary Constraint Satisfaction Problems with and
POLYSA: A Polynomal Algorthm for Non-bnary Constrant Satsfacton Problems wth and Mguel A. Saldo, Federco Barber Dpto. Sstemas Informátcos y Computacón Unversdad Poltécnca de Valenca, Camno de Vera s/n
More informationTechnical Report, SFB 475: Komplexitätsreduktion in Multivariaten Datenstrukturen, Universität Dortmund, No. 1998,04
econstor www.econstor.eu Der Open-Access-Publkatonsserver der ZBW Lebnz-Inforatonszentru Wrtschaft The Open Access Publcaton Server of the ZBW Lebnz Inforaton Centre for Econocs Becka, Mchael Workng Paper
More informationASSESSING THE AVAILABILITY AND ALLOCATION OF PRODUCTION CAPACITY IN A FABRICATION FACILITY THROUGH SIMULATION MODELING: A CASE STUDY
Internatonal Journal of Industral Engneerng, 15(2), 166-175, 2008. ASSESSING THE AVAILABILITY AND ALLOCATION OF PRODUCTION CAPACITY IN A FABRICATION FACILITY THROUGH SIMULATION MODELING: A CASE STUDY J.H.
More informationIMPACT ANALYSIS OF A CELLULAR PHONE
4 th ASA & μeta Internatonal Conference IMPACT AALYSIS OF A CELLULAR PHOE We Lu, 2 Hongy L Bejng FEAonlne Engneerng Co.,Ltd. Bejng, Chna ABSTRACT Drop test smulaton plays an mportant role n nvestgatng
More informationFREQUENCY OF OCCURRENCE OF CERTAIN CHEMICAL CLASSES OF GSR FROM VARIOUS AMMUNITION TYPES
FREQUENCY OF OCCURRENCE OF CERTAIN CHEMICAL CLASSES OF GSR FROM VARIOUS AMMUNITION TYPES Zuzanna BRO EK-MUCHA, Grzegorz ZADORA, 2 Insttute of Forensc Research, Cracow, Poland 2 Faculty of Chemstry, Jagellonan
More informationLITERATURE REVIEW: VARIOUS PRIORITY BASED TASK SCHEDULING ALGORITHMS IN CLOUD COMPUTING
LITERATURE REVIEW: VARIOUS PRIORITY BASED TASK SCHEDULING ALGORITHMS IN CLOUD COMPUTING 1 MS. POOJA.P.VASANI, 2 MR. NISHANT.S. SANGHANI 1 M.Tech. [Software Systems] Student, Patel College of Scence and
More informationAN APPOINTMENT ORDER OUTPATIENT SCHEDULING SYSTEM THAT IMPROVES OUTPATIENT EXPERIENCE
AN APPOINTMENT ORDER OUTPATIENT SCHEDULING SYSTEM THAT IMPROVES OUTPATIENT EXPERIENCE Yu-L Huang Industral Engneerng Department New Mexco State Unversty Las Cruces, New Mexco 88003, U.S.A. Abstract Patent
More informationAn Evaluation of the Extended Logistic, Simple Logistic, and Gompertz Models for Forecasting Short Lifecycle Products and Services
An Evaluaton of the Extended Logstc, Smple Logstc, and Gompertz Models for Forecastng Short Lfecycle Products and Servces Charles V. Trappey a,1, Hsn-yng Wu b a Professor (Management Scence), Natonal Chao
More informationInformation Sciences
Informaton Scences 0 (013) 45 441 Contents lsts avalable at ScVerse ScenceDrect Informaton Scences journal homepage: www.elsever.com/locate/ns A hybrd method of fuzzy smulaton and genetc algorthm to optmze
More information行 政 院 國 家 科 學 委 員 會 補 助 專 題 研 究 計 畫 成 果 報 告 期 中 進 度 報 告
行 政 院 國 家 科 學 委 員 會 補 助 專 題 研 究 計 畫 成 果 報 告 期 中 進 度 報 告 畫 類 別 : 個 別 型 計 畫 半 導 體 產 業 大 型 廠 房 之 設 施 規 劃 計 畫 編 號 :NSC 96-2628-E-009-026-MY3 執 行 期 間 : 2007 年 8 月 1 日 至 2010 年 7 月 31 日 計 畫 主 持 人 : 巫 木 誠 共 同
More informationConferencing protocols and Petri net analysis
Conferencng protocols and Petr net analyss E. ANTONIDAKIS Department of Electroncs, Technologcal Educatonal Insttute of Crete, GREECE ena@chana.tecrete.gr Abstract: Durng a computer conference, users desre
More informationSTATE HIGHWAY ADMINISTRATION RESEARCH REPORT ENHANCEMENT OF FREEWAY INCIDENT TRAFFIC MANAGEMENT AND RESULTING BENEFITS
MD-11- SP009B4Q STATE HIGHWAY ADMINISTRATION RESEARCH REPORT ENHANCEMENT OF FREEWAY INCIDENT TRAFFIC MANAGEMENT AND RESULTING BENEFITS WOON KIM AND MARK FRANZ GANG-LEN CHANG DEPARTMENT OF CIVIL AND ENVIRONMENTAL
More informationMany e-tailers providing attended home delivery, especially e-grocers, offer narrow delivery time slots to
Vol. 45, No. 3, August 2011, pp. 435 449 ssn 0041-1655 essn 1526-5447 11 4503 0435 do 10.1287/trsc.1100.0346 2011 INFORMS Tme Slot Management n Attended Home Delvery Nels Agatz Department of Decson and
More informationAPPLICATION OF COMPUTER PROGRAMMING IN OPTIMIZATION OF TECHNOLOGICAL OBJECTIVES OF COLD ROLLING
Journal Journal of Chemcal of Chemcal Technology and and Metallurgy, 50, 6, 50, 2015, 6, 2015 638-643 APPLICATION OF COMPUTER PROGRAMMING IN OPTIMIZATION OF TECHNOLOGICAL OBJECTIVES OF COLD ROLLING Abdrakhman
More informationLecture 3: Force of Interest, Real Interest Rate, Annuity
Lecture 3: Force of Interest, Real Interest Rate, Annuty Goals: Study contnuous compoundng and force of nterest Dscuss real nterest rate Learn annuty-mmedate, and ts present value Study annuty-due, and
More informationForecasting the Demand of Emergency Supplies: Based on the CBR Theory and BP Neural Network
700 Proceedngs of the 8th Internatonal Conference on Innovaton & Management Forecastng the Demand of Emergency Supples: Based on the CBR Theory and BP Neural Network Fu Deqang, Lu Yun, L Changbng School
More informationSCHEDULING OF CONSTRUCTION PROJECTS BY MEANS OF EVOLUTIONARY ALGORITHMS
SCHEDULING OF CONSTRUCTION PROJECTS BY MEANS OF EVOLUTIONARY ALGORITHMS Magdalena Rogalska 1, Wocech Bożeko 2,Zdzsław Heduck 3, 1 Lubln Unversty of Technology, 2- Lubln, Nadbystrzycka 4., Poland. E-mal:rogalska@akropols.pol.lubln.pl
More informationInterest Rate Futures
Interest Rate Futures Chapter 6 6.1 Day Count Conventons n the U.S. (Page 129) Treasury Bonds: Corporate Bonds: Money Market Instruments: Actual/Actual (n perod) 30/360 Actual/360 The day count conventon
More informationImperial College London
F. Fang 1, C.C. Pan 1, I.M. Navon 2, M.D. Pggott 1, G.J. Gorman 1, P.A. Allson 1 and A.J.H. Goddard 1 1 Appled Modellng and Computaton Group Department of Earth Scence and Engneerng Imperal College London,
More informationIn some supply chains, materials are ordered periodically according to local information. This paper investigates
MANUFACTURING & SRVIC OPRATIONS MANAGMNT Vol. 12, No. 3, Summer 2010, pp. 430 448 ssn 1523-4614 essn 1526-5498 10 1203 0430 nforms do 10.1287/msom.1090.0277 2010 INFORMS Improvng Supply Chan Performance:
More informationOn the Optimal Control of a Cascade of Hydro-Electric Power Stations
On the Optmal Control of a Cascade of Hydro-Electrc Power Statons M.C.M. Guedes a, A.F. Rbero a, G.V. Smrnov b and S. Vlela c a Department of Mathematcs, School of Scences, Unversty of Porto, Portugal;
More informationA Secure Password-Authenticated Key Agreement Using Smart Cards
A Secure Password-Authentcated Key Agreement Usng Smart Cards Ka Chan 1, Wen-Chung Kuo 2 and Jn-Chou Cheng 3 1 Department of Computer and Informaton Scence, R.O.C. Mltary Academy, Kaohsung 83059, Tawan,
More informationAllocating Time and Resources in Project Management Under Uncertainty
Proceedngs of the 36th Hawa Internatonal Conference on System Scences - 23 Allocatng Tme and Resources n Project Management Under Uncertanty Mark A. Turnqust School of Cvl and Envronmental Eng. Cornell
More informationSelfish Constraint Satisfaction Genetic Algorithm for Planning a Long-distance Transportation Network
JOURNAL OF COMPUTERS, VOL. 3, NO. 8, AUGUST 2008 77 Selfsh Constrant Satsfacton Genetc Algorthm for Plannng a Long-dstance Transportaton Network Takash Onoyama and Takuya Maekawa Htach Software Engneerng
More informationAn Integrated Approach for Maintenance and Delivery Scheduling in Military Supply Chains
An Integrated Approach for Mantenance and Delvery Schedulng n Mltary Supply Chans Dmtry Tsadkovch 1*, Eugene Levner 2, Hanan Tell 2 and Frank Werner 3 2 1 Bar Ilan Unversty, Department of Management, Ramat
More informationNON-CONSTANT SUM RED-AND-BLACK GAMES WITH BET-DEPENDENT WIN PROBABILITY FUNCTION LAURA PONTIGGIA, University of the Sciences in Philadelphia
To appear n Journal o Appled Probablty June 2007 O-COSTAT SUM RED-AD-BLACK GAMES WITH BET-DEPEDET WI PROBABILITY FUCTIO LAURA POTIGGIA, Unversty o the Scences n Phladelpha Abstract In ths paper we nvestgate
More informationThe Safety Board recommends that the Penn Central Transportation. Company and the American Railway Engineering Association revise
V. RECOWNDATONS 4.! The Safety Board recommends that the Penn Central Transportaton Company and the Amercan Ralway Engneerng Assocaton revse ther track nspecton and mantenance standards or recommended
More informationSingle and multiple stage classifiers implementing logistic discrimination
Sngle and multple stage classfers mplementng logstc dscrmnaton Hélo Radke Bttencourt 1 Dens Alter de Olvera Moraes 2 Vctor Haertel 2 1 Pontfíca Unversdade Católca do Ro Grande do Sul - PUCRS Av. Ipranga,
More informationModule 2 LOSSLESS IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur
Module LOSSLESS IMAGE COMPRESSION SYSTEMS Lesson 3 Lossless Compresson: Huffman Codng Instructonal Objectves At the end of ths lesson, the students should be able to:. Defne and measure source entropy..
More informationManaging Cycle Inventories. Matching Supply and Demand
Managng Cycle Inventores Matchng Supply and Demand 1 Outlne Why to hold cycle nventores? Economes of scale to reduce fxed costs per unt. Jont fxed costs for multple products Long term quantty dscounts
More information