Optimization of Nurse Scheduling Problem with a Two-Stage Mathematical Programming Model
|
|
- Godfrey Melton
- 8 years ago
- Views:
Transcription
1 Asa Pacfc Managemen Revew 15(4) (2010) Opmzaon of Nurse Schedulng Problem wh a Two-Sage Mahemacal Programmng Model Chang-Chun Tsa a,*, Cheng-Jung Lee b a Deparmen of Busness Admnsraon, Trans World Unversy, Tawan b Deparmen of Informaon Managemen, Naonal Yunln Unversy of Scence and Technology, Tawan Acceped 6 June Absrac Ths paper consrucs a wo-sage mahemacal programmng model o solve he nurse schedulng problem n order o assgn nurses o shfs over a schedulng perod so ha ceran consrans (organzaonal and personal) are sasfed. In he frs sage, he nurse opmal vacaon schedules are solved by a self-schedule programmng ha can check for any volaon of governmen regulaons, hospal managemen requremens, and schedulng farness. In he second sage, he nurse roser schedule s arranged and a Genec Algorhm (GA) s furher adoped o derve he opmal schedule. An emprcal case sudy s performed and he resuls show ha he proposed approach can solve he nurse schedulng problem effcenly. In addon, can also be easly modfed o su dfferen cases encounered n hospals. Keywords: Inernaonal mahemacal programmng model, genec algorhm, self-schedule, nurse schedulng 1. Inroducon Nursng saff schedulng s an essenal ask n manpower resource managemen. The schedulng qualy drecly nfluences he nursng qualy and workng moral. Nurse schedulng problems represen a subclass of schedulng problems (Ender, 2005). Typcally, personnel schedulng problems are hghly consraned and complex opmzaon problems (Erns e al., 2004). The need o ake no accoun ndvdual preferences furher complcaes he process. In recen years, he emergence of larger and more consraned problems has presened a real challenge. Because obanng good qualy soluons can lead o a hgher level of personnel sasfacon (Burke e al., 2006). Cheang e al. (2003) added nursng saff s preferences no he facors o be consdered when preparng work schedules. In addon, Bard and Purnomo (2007) consdered oher facors, such as nurse workforce, hospal work and hospal schedulng regulaons, o esablsh a schedule-makng decson ree. The consran condons for nurse schedulng are broad, and may dffer from case o case. Some of he consran condons even conflc wh each oher. For nsance, he shf preference of nursng saff may volae he requremen for shf farness. In pracce, he nurse chefs arrange he schedule based on her subjecve experence. To mee he complcaed suaons wh ever-ncreasng paen demands and a lmed nurse workforce, he chefs may requre more me and effor han ever o deal wh he schedulng and sll fal o be far o all he saff. Consequenly, he nurse schedulng ssue remans challengng, and developmen of a more sophscaed approach o solve he problem deserves furher exploraon. Rondeau (1990) and Belzhoover (1994) mananed ha self-schedulng reduces he rao of shf-changes, ncreases opporunes for on-he-job ranng, and ncreases ndvdual * Correspondng auhor. Emal: jmsa@mdu.edu.w 503
2 C.-C. Tsa, C.-J. Lee / Asa Pacfc Managemen Revew 15(4) (2010) auonomy and self-awareness, whle also helpng saff o beer enjoy her socal and famly lves. Abbo (1995) also noed ha self-schedulng reduces nerference n he personal lves of nursng saff, reducng shf-changes suaons and requess for leave, and ulmaely boosng sasfacon owards work. Though self-schedulng has numerous advanages, communcaon and coordnaon problems are s major lmaons. Consequenly, hs sudy employs a modfed self-schedulng mehod o mprove hese weaknesses. Wh regard o solvng he nurse schedulng problem, Smh and Wggns (1977) proposed hree caegores of approach: cyclcal, heursc, and mahemacal programmng. The cyclcal schedulng approach has shf and vacaon arrangemens se up by he nurse chefs based on he needs of he nurse un, he regulaons of hospal, and he number of nursng saff. The cyclcal schedulng approach normally ulzes a cyclcal schedulng paern on a fxed me range. For he heursc schedulng approach, he nurse chefs ofen consruc a decson ree wh consderaon of nursng saff workforce, nurse servce paerns, hospal schedulng polcy, and oher facors, and hen ulze he resulng schedule on a cyclcal bass. The mahemacal programmng approach s a specal mahemacal model developed o respond o he schedulng problems for dfferen cases. Normally, s consruced wh objecve funcons and consran equaons and hen ulzes approprae algorhms o search for he opmal soluons. The aforemenoned hree nurse schedulng approaches all have her advanages and dsadvanages. The cyclcal schedulng approach can be convenenly execued; however, a new schedule mus be arranged when nurses need o change her job or shfs, whch n s que common n pracce. The heursc schedulng approach needs a decson-makng ree o develop he schedulng rules, bu because he neracon among nursng saff s very complcaed, he ree requred s usually huge. Thus, when he consran condons are numerous, wll generally be dffcul for he heursc schedulng approach o aan a reasonable soluon, and he nurse schedulng acves canno be easly processed (Harvey and Mona, 1998). The mahemacal programmng approach has a subsanal level of dependency on he cases addressed, and when dealng wh dfferen cases requres furher reformulaon, meanng addonal me and effor need o be spen on he projec. A nurse schedulng sysem can be bul up and execued n varous ways. Ahuja and Sheppard (1975) developed a four-module four-sage neracve cyclcal schedulng sysem, whch used a compuer o arrange schedules for dfferen nursng saff. Ther sysem consss of four modules: (a) work paern selecor - denfes cyclcal schedule paerns from he npu nformaon, and dfferen case hospals may have dfferen work paerns; (b) work schedule assembler - combnes nursng saff wh he work paerns generaed by he frs module; (c) work schedule projecor - dsplays he work schedules for boh he ndvduals and he organzaon; (d) work predcon and allocaon of saff - desgns a work load ndex accordng o he requremens of he nursng saff and hen assgns work o saff based on hs work load ndex. Smh and Wggns (1977) developed a bached hree-sage cyclcal schedulng sysem o arrange he nurse schedulng, whch ncludes (a) summarzng he requremens of saff for specfed uns on weekly bases; (b) generang prelmnary schedules and evaluang he schedules wh he consran condons o check f here s any conflc; (c) manually adjusng he prelmnary schedule and creang he fnalzed schedule. Kosreva and Jennng (1991) ndcaed ha a nurse schedulng sysem should nclude survey and scheduler modules. Ineger programmng, mxed neger programmng, goal programmng, lnear programmng, nework programmng, and consran programmng have all been used o solve he nurse schedulng problem. For nsance, Mller e al. (1976), Ozkarahan and Baley (1988) ulzed he neger programmng o search for a schedule wh he lowes averson 504
3 C.-C. Tsa, C.-J. Lee / Asa Pacfc Managemen Revew 15(4) (2010) devaons; whereas Warner (1976) employed goal programmng wh mulple-choces o solve nurse schedulng problems. In addon, Kosreva e al. (1978) and Bell e al. (1986) developed mxed neger programmng models; whle Arher and Ravndran (1981) used 0-1 goal programmng o solve wo-sage cyclcal schedulng problems. Musa and Saxena (1984) adoped 0-1 goal programmng and heursc search, and Azaez and Sharf (2005) also used 0-1 goal programmng o solve nurse schedulng problem. Baley (1985) developed a cyclcal schedulng model wh neger programmng. Brge e al. (1998) ulzed lnear programmng o oban he soluon ha can smulaneously mnmze he oal paymen, sasfy he saff preference, and level he nurse workforce. Harvey and Mona (1998) employed nework programmng o sudy he cyclcal and non-cyclcal nurse schedulng problems on he bass of 12-hour shfs. Fnally, Meyer (2001) used consran programmng o solve nurse schedulng problems. Oher echnques have also been found, and Randhawa and Sompul (1993) developed a heursc schedulng decson-makng suppor sysem o handle he mulple-goal programmng problems wh bnary varables; whereas Ackeln and Dowsland (2000) used genec algorhms o solve nurse schedulng problems. Dowsland and Thompson (2000) combned Tabu search and nework programmng o esablsh a non-cyclcal schedulng sysem; whle Dmr (2002) used genec algorhms o solve cyclcal schedulng problems. Ackeln and L (2006) used Bayesan opmzaon algorhm o solve nurse schedulng problems. Goldberg (1989) and Sharf (2000) poned ou ha he advanages of GA are numerous. GA can solve he opmzaon problem wh mulple varables; can perform parallel processng, whch can effecvely save processng me. GA does no need o calculae he dfferenal value of he fness funcon, because he naural selecon process s deermned by he fness of chromosomes; s a mulple pons search nsead of a sngle pon search approach, whch has a relavely hgh probably of fndng he value ha s que close o he global opmum raher han beng rapped n a local search. In addon, GA s suable for use n a compuerzed envronmen. In lgh of hese advanages, hs sudy aemps o develop a dfferen approach by negrang a mahemacal programmng approach wh he GA o solve he nurse schedulng problem. When dealng wh dfferen cases, he solvng algorhm does no need o be re-adjused. Insead, we only need o se new objecve funcons and consran condons. Ths sudy wll ncorporae he hospal managemen requremens, governmen regulaons, and nursng saff s shf preferences no a wo-sage mahemacal model. In he frs sage, he nurse opmal vacaon schedules are solved by a self-schedule programmng ha can check for any volaon of governmen regulaons, hospal managemen requremens, and he schedulng farness. In he second sage, he nurse roser schedule s arranged and a Genec Algorhm (GA) s furher adoped o solve he opmal schedule. The remanng pars of hs paper are organzed as follows. Secon wo develops he nurse work and vacaon model and he nurse roser schedule model. Secon hree nroduces he GAs for solvng boh models. In secon four, an Obsercs hospal n Kaohsung, Tawan s suded as our emprcal case, and fnally he concludng remarks are gven. 2. Model developmen Two mahemacal programmng models are proposed n hs sudy. Model I s he holday schedule model based on self-schedulng n order o allow he shf-able o apply nursng saff resources mos effcenly. Model II s scheduled he enre shf-able o oban he mos approprae shf-able. 505
4 C.-C. Tsa, C.-J. Lee / Asa Pacfc Managemen Revew 15(4) (2010) A blank shf-able wll be offered for he nex monh due o he holday self-schedule mehod. All nursng saffs mark her own desred off days on he blank shf-able, he scheduler has o negoae and se prory o solve he conflc problem. To ease he burden of he scheduler and ensure he farness, Model I s desgned o denfy he opmal soluon of a complee off-shf able schedulng usng LINGO due o he decson-makng varables are deermned. Model II s creaed o resul he enre shf-able by arrangng he shfs for each nursng saff n he second sage. Model II s a mxed neger non-lnear programmng problem (MINLP) usng GA o solve hs parcular ssue. 2.1 Mahemacal model for he holday self-schedule (Model I) The execuon seps for he holday self-schedule mehod are lsed below: Sep 1: Ls he number of off days and holdays avalable for each nursng saff, hen have all of he nursng saff mark her own desred off days. Sep 2: When oo many saff selec he same day, he scheduler has o negoae and se prory, rankng he mporance of he reasons of dfferen ndvduals for wanng he day off. When negoaon s unsuccessful, he dspue s seled by a lucky draw. Sep 3: Calculae he shorage of off days on holdays and weekdays for each saff member. Sep 4: Schedule a complee off shf able. To ease he burden of he scheduler, and ensure he farness and qualy of he off shfs able, hs sudy desgns a mahemacal programmng model o denfy he opmal soluon of Sep 4. Ths sudy uses he followng noaon for problem modelng: (1) Indexng Ses: : nursng saff ndex ; = 1, 2,, N : dae ndex; = 1, 2,, T (2) Parameers: N: oal numbers of nursng saff T: schedule days H : shorage of off days on holdays for he -h nursng saff C : shorage of off-days on weekdays for he -h nursng saff R : maxmum number of nurses avalable for -h day. T sun : ses of Sundays. T sa : ses of Saurdays. T ho : ses of Naonal Holdays. T 1 : ses of Holdays. [ T1 = (Tsun Tsa Thol )] T 2 : ses of weekdays. [ (T - T )] T = 2 1 D E, N ) :number of nursng saff requred on day (evenng, overngh) shf of ( 506
5 C.-C. Tsa, C.-J. Lee / Asa Pacfc Managemen Revew 15(4) (2010) h day. E (N) :he average days of evenng (overngh) shf on whch flexble shf nursng saff are requred o work n he enre shf able. D E, N ) :accumulaed frequency of -h nursng saff s workng on day (evenng, ( overngh) shf n he enre shf able. (3) Decson Varables ' R 1 = 0 arrange he -h oherwse nurse saff ohave off-dayson -h day n he nalshf able 1 arrangehe -h nurse saff o have off-dayson -h day n heenreshf able. R = 0 oherwse Dum = 0 or 1, Dummy varable ' ' ' 1 D ( E, N ) = 0 oherwse 1 arrangeheh nursesaff = 0 oherwse D E N 1 = 0 1 = 0 oherwse he h nurse saff prearrange day (evenng, overngh) o haveday shf on h day. arrangeheh nursesaff o have evenngshf on h day. arrangeheh nursesaff o haveoverngh shf on h day. oherwse Mn [ Z, Z Z ] 1 2, 3 shf on h day Z = (1) 2 2 Z1 = ( R ) N R N, Tsun (2) 2 N N 2 Z2 = ( R ) N R N, Tsa (3) 2 N N 2 Z3 = ( R ) N R N, Thol (4) N N Subjec o R T 1 T 2 ' = R + Dum, N, Dum = H, N T (5) (6) Dum = C, N (7) R R, T (8) N R + R ( 1) + R ( 2) + R( 3) + R ( 4) + R( 5) + R ( 6) 1, N, T (9) 507
6 C.-C. Tsa, C.-J. Lee / Asa Pacfc Managemen Revew 15(4) (2010) Equaon (1) s he objecve funcon of he off-shf able n hs sudy, and was derved from formulas (2), (3), and (4). Ths equaon negraes he hree funconal ndexes above no a sngle objecve funcon hrough lnear amalgamaon. The wegh of each funcon s deermned by rankng he saff preferences. Equaons (2), (3) and (4) represen he varance of off-days number on he Saurday, Sunday and naonal holdays. Consran (5) ndcaes he defnon of varable and ensures he raonaly of, whle avodng conradcon beween he orgnal and fnal off-shf ables. Consrans (6) and (7) are desgned o sasfy all ndvdual members of nursng saff wh regard o her off days and off holdays. Consran (8) exss o preven oo many people akng leave on he same day and leadng o an nadequae number saff beng on duy. Fnally, consran (9) s creaed o sasfy he un polcy of no more han sx consecuve work days for any ndvdual. 2.2 Mahemacal model of schedulng for he enre shf-able (Model II) Afer schedulng a complee off-shf able, he enre shf-able can be smply compleed by arrangng he shfs for each nursng saff on her work days. Smlarly, hs sudy proposes a MINLP model as followng: Mn [ Z, Z, Z, Z, Z, Z Z ] Z = (10) , 7 Z 1 = ( E( 3) D ( 2) E( 1) D ) (11) Z 2 = ( D( 2) N( 1) R ) (12) Z 3 = ( E( 2) N ( 1) R ) (13) Z 4 = ( N( 2) R( 1) N ) (14) N T ' ' ' ' ' ' Z5 = ( D + E + N ) ( D D + E E + N N ) / 2 (15) A = N T E E Z = [ A ] [] represens he Gaussan Funcon (16) A 6 = N N Z = [ A ] [] represens he Gaussan Funcon (17) 7 Subjec o N N N D D, T E = E, T N = N, T D + E + N + R =, N, T N 1) + D 1, N, T 508 (18) (19) (20) 1 (21) ( (22) Equaon (10) represens he objecve funcon of hs mahemacal model, whch s derved from equaons (11) hrough (17). Ths sudy negraes he above-menoned sevenfuncons no a sngle arge one. The wegh of each ndvdual funcon s ranked based on nursng saff preference, and he mos favored s assgned he larges ndex value, for example
7 C.-C. Tsa, C.-J. Lee / Asa Pacfc Managemen Revew 15(4) (2010) seven. Fnally, he ndexes are oaled and he wegh ndex s calculaed based on he percenage aken by each funcon. Equaon (11) expresses he oal number of mes he evenng-day paern occurred durng any four-consecuve days. Moreover, equaons (12), (13) and (14) represen he oal occurrence of day-overngh-off shfs, evenng-overngh-off shfs and overngh-offoverngh shfs n any hree consecuve days, respecvely. Equaon (15) calculaes he number of nfrngemens beween he fnal fxed shf-able and he former saff-preferred shf-able; meanwhle, equaons (16) and (17) express he oal exceed numbers over he requred evenng and overngh shfs for all nursng saff. Consran (18) ensures ha he acual schedulng resul mees he saffng requremens for he daly day-shf, whle consrans (19) and (20) ensure ha s me for he daly evenng and overngh shfs. Furhermore, consran (21) ses he lm ha each nursng saff should no work more han egh hours a day, whle consran (22) prohbs overnghday shfs. 3. Model solvng algorhms and process NCS Ths sudy dvdes nurse schedulng operaon no wo models. The solvng algorhms and process for boh models s brefly nroduced below: (1) Holday self-schedule Durng he execuon seps for he holday self-schedule mehod (secon 2.1), mos decson-makng varables are deermned (from seps 1~3). Hence, hs sudy seeks he soluon wh he sofware package LINGO for he sep 4. (2) Overall schedule Model II s MINLP ha can be solved by he LINGO, a GA s furher adoped o solve he opmal schedule and s wren usng MATLAB language. The soluon-seekng seps are presened below. Sep 1. Producng an ndvdual s decded by codng When applyng he heredy algorhm o solve he problem, he varable desgned mus be ransformed, regardless of wheher s a measurng ndex or a numercal ndex, no code form. Dfferen codng mehods are adoped for dfferen ypes of problems. Genes are used code, and recorded along wh he heredary feaures of ndvdual creaures. The sze of each ndvdual s se as a marx of N x T, wh he horzonal axs as he schedulng dae, and he vercal axs as he labeled number of each ndvdual. The bye value s an neger from 1 o 4. 1 represens day-shfs, 2 denoes evenng shfs, 3 sands for overngh shfs, and 4 represens off-shfs. Three nurses work he evenng shf on he frs day and wll have a day off on he second day, work he day shf on he hrd day, and he overngh shf on he fourh day, (please refer o fgure 1 for deals). Because he off days for each nursng saff are deermned by holday self-schedulng, he locaon of bye value 4 s fxed for each ndvdual. Furhermore, each bye has only four possbles: 1, 2, 3 and 4. Sasfacon of he lmed formula 22 for each nursng saff means ha hey should no work more han egh hours a day. 509
8 C.-C. Tsa, C.-J. Lee / Asa Pacfc Managemen Revew 15(4) (2010) Fgure 1. The codes are arranged n he form of a srng represenng chromosomes. Sep 2. Defnng approprae funcons Before seekng a soluon usng GA, he funcons of appropraeness mus be defned o assess he effcacy of he soluon. Ths sudy ses he approprae funcon as he objecve funcon (17). Sep 3. Reproducon When selecng an ndvdual for he purpose of reproducon, naural selecon ndcaes ndvduals wh hgher adapaon capacy have a beer chance of beng seleced. The mehod of selecon s he smples and he mos commonly used rao mehod. In hs, he rae of reproducon s deermned by usng he percenage of oal funcon value represened by he funcon value of appropraeness of an ndvdual; namely, he chance of an ndvdual beng chosen depends on s appropraeness. Ths sudy seleced he presenaon mehod of 1 2 N choosng probably, where ψ { pop = X, X,..., X } represens he N pop soluons n generaon, and N pop represens he number of ndvduals n a race. The chance of each soluon X beng seleced as a paren srng s P ( ) : X 2 [ f M ( ψ ) f ( X )] [ f M ( ψ ) f ( X )] P( X ) = 2 (23) X ψ In formula (23), f M ( ψ ) s defned as he poores arge funcon value n he generaon chromosome, whle f ( X ) represens he arge funcon value of every soluon of X n generaon. Sep 4. Crossover The crossover procedure s desgned accordng o he specal feaures of he model, explaned as follows. Before mang s conduced, wo paren ndvduals are seleced by usng he reproducon algorhm, and wo cung pons were deermned randomly. Genes are reproduced from he cung pons of he paren generaon n he same locaon as he chld generaon. Oher genes of he chld generaon are replaced by he genes whn he cung pons of anoher paren, as presened n Fgure 2 (represened by he frs row). Ths sudy pus forward he hypohess ha f wo paren ndvduals proceed o a crossover 510
9 C.-C. Tsa, C.-J. Lee / Asa Pacfc Managemen Revew 15(4) (2010) Fgure 2. Paren ndvdual before crossover. Fgure 3. Chld ndvdual afer crossover. algorhm, he wo cung pons are 1 and 5, and Fgure 3 llusraes he resuls of he crossover. Sep5. Muaon The heursc muaon of hs sudy s self-desgned based on he specal feaures of model, explaned n he consrans, above, and each ndvdual aemps o sasfy consrans (19), (20), and (21), ensurng ha he schedule resul sasfes he daly requremen for dayshfs and manans he mnmum nursng manpower for evenng and overngh shfs. The muaon rules are hus as follows: (a) each ndvdual s capable of muaonal calculaon and each sasfes consrans (19), (20) and (21). (b) The un of ndvdual muaon s he lne, and he muaonal algorhm reas each lne one by one. 4. Emprcal case analyss 4.1 Case overvew and problem descrpon Ths sudy adoped nursng saff schedulng n he Dep. of Obsercs and Genecology (Ob-Gyn) of a hospal n Kaohsung as a case sudy. Ths case sudy nvolved hree shfs a day, namely day-shf (AM 8:00~PM 4:00), evenng shf (PM 4:00~AM 0:00) and overngh shf (AM 0:00~AM 8:00). A one-monh cycle me was used. The un conaned 14 nursng saff, wh requred manpower of fve saff for he day-shf, and hree and wo saff for evenng and overngh shfs, respecvely. The consans n hs sudy s schedulng sysem are se as follows: 1. Shfs durng annual leave are scheduled hrough loery. Moreover, he head nurse gves he prvlege of off shfs on New Year s Day, Tomb-Sweepng Day, Dragon-boa Fesval and Md-auumn Fesval o hose who dd no ake annual leave; 2. Leave on New Year s Day, Tomb-Sweepng Day, Dragon-boa Fesval and Md-auumn Fesval should no be regsered n advance; 3. The shf-able marks he number of off days and holdays avalable per saff member per monh; 4. Holdays nclude Saurdays, Sundays and Naonal Holdays, bu no New Year s Day, Tomb-Sweepng Day, Dragon-boa Fesval and Md-auumn Fesval; 5. Unless necessary, he schedulng of regular off days on Saurdays, Sundays, or Naonal Holdays s avoded, wh aemps beng made o evenly dsrbue off days a hese mes; 6. The maxmum number of consecuve workng days scheduled for a gven ndvdual s sx; 7. Pror schedulng s permed for specal reasons (brhs, weddngs, engagemens, overseas ravels, or specal long leave.) 511
10 C.-C. Tsa, C.-J. Lee / Asa Pacfc Managemen Revew 15(4) (2010) For acqurng he opmal resul of Model I and Model II, wo sofware (LINGO and MATLAB) were run on a personal compuer wh a Penum ΙΙI 450MHz CPU. Wh regardng o he sze of he Model II s lsed as followng: he number of varables s equal o 4 * N * T + 3 * T ; he number of consrans s 3 * T + 2 * N * T. The nformaon on off days for each nursng saff n he Ob-GYN should be enered. Ths sudy s conduced n March 2005; he analyss and comparson beween he shf-able. The orgnal manual schedule s as follows. 4.2 Analyss of he holday self-schedule n he OB-GYN Dep. Based on he execuon seps and he mahemacal model (model I) of he holday selfschedule mehod, he off day shf able s shown n he Table 1. Durng he schedule roaon, nursng saff scheduled off days as hey desred (113 days n oal). However, owng o surplus manpower on specfc days, he scheduler had o make some coordnaon and adjusmen. One hundred and wo days of he acual off day shf able were he same as he orgnal schedule from he preferred off day able. Therefore, mos of off days (90.3%) are dencal o he orgnal schedule chosen by he saff. Table 2 gves he resuls of he survey of he nursng saff regardng he holday self-schedule mehod. 4.3 Sysem parameers and he solvng resul In he second sage, GA s adoped o opmze he nurse schedule. Ths sudy esablshed parameers such as populaon sze, probably of muaon and so on for execung GA. Table 3 lss he seleced facors and he level values ha were seleced o ncrease he effcency of problem solvng. A oal of egh (2 x 2 x 2) combnaons of dfferen conrollng facors were used. Thry ess were conduced for each combnaon. From Table 4, he ermnaon condon s se a he 50h generaon, and he chance of obanng he bes soluon s se a he 30h generaon. Therefore, hs sudy se he ermnaon condon a he 50h generaon. From es numbers 5~8 n Table 5, under he ermnaon condon, populaon sze and he ncrease n he probably of mang provded no clear asssance n obanng he opmal soluon, and sgnfcanly ncreased he sysem calculaon me. Therefore, hs sudy ses he populaon sze a 40 and he probably of mang a 0.7. Table 1. The off-day shf able. R: Off-day 512
11 C.-C. Tsa, C.-J. Lee / Asa Pacfc Managemen Revew 15(4) (2010) Iems Table 2. Survey on holday self-schedulng n he OB-GYN Dep. 1. The pracce of holday selfschedulng ncreases schedulng auonomy and makes easer for me o decde my own holdays. 2. The sysem mproves my chances of geng days off when I wan hem, and enhances my sasfacon regardng schedulng. 3. My chances of geng he days off ha I waned were ncreased, and wh a few excepons mos of he off days were selfscheduled. Srongly Agree 513 Agree No Commen Dsagree Srongly Dsagree 92.86% 7.14% % 14.4% % 14.4% In comparson wh he enre shf-able, Table 5 s derved from usng he GA and he orgnal manual shf-able. The resuls acqured from he model can be easly obaned, and he approach presened n hs sudy s beer han he manually scheduled mehod, as can deermne he mos approprae shf-able n jus fve mnues. Therefore, he model presened here serves as a good reference for any medcal un seekng o solve s nursng shf schedule problem. Table 3. Seleced conrollng facors and her level value. Tes No. Alas Conrollng Facors Level Value A Termnaon Condon 2 nd Level (30,50) B Populaon Sze 2 nd Level (40,80) C Probably of Muaon 2 nd Level (0.3,0.7) Termnaon condon (A) Table 4. Parameers: Combnaon and relaed soluon quales. Sze of populaon (B) Probably of muaon (C) Bes soluonseekng resuls Probably of geng he bes soluon Average solvng me (sec.) (22/30) (22/30) (23/30) (25/30) (27/30) (26/30) (28/30) (27/30) Concludng remarks Ths sudy presens wo effcen mahemacal programmng models and apples GA o deermne he opmal nursng saff shf schedule. Unlke mos exsng approaches, he new approach has he ably o buld schedules. Ths sudy demonsraes a wo-sage effcen and
12 C.-C. Tsa, C.-J. Lee / Asa Pacfc Managemen Revew 15(4) (2010) flexble mahemacal programmng model and arrved wh sold resul raher han radonal schedulng. Upon he needs of he nursng saff, hs approach s able o adjus he objecve funcon, consrans and her weghed value o ncrease he flexbly and generaly of he schedulng model. In parcular, hs sudy proposed wo sgnfcan ssues hghly valued: one s he saff farness prncple, and he oher s he self-deermned schedulng prncple. Hence, he ulmae schedule ruly reflecs he preferences of nurse saff as well as he managemen requremens. The expermenal resuls demonsraed he srengh of hs approach. The conrbuons are as follows. Frsly, hs sudy appled GA o oban he enre shfable. Ths model copes wh dfferen schedulng cases wh he proposed sold core algorhm. I s hghly adapve o oher applcaons. Secondly, hs sudy proposes a heursc muaon mehod o sgnfcanly reduce he schedulng seup me. Thrdly, hs sudy developed a schedulng sysem o handle he schedulng acves. Ths approach can reduce he nurse chef s schedulng workload and also ncrease he nurse saff sasfacon by provdng he saff vacaon farness and more respec on self-deermnaon schedule. Fuure research could be exended o reflec he effec on employee sasfacon and fnancal performance mprovemen. Ths research gves some prelmnary answers of how o nclude human-lke learnng no schedulng algorhms and hs approach mgh be neresed o praconers and researchers n areas of schedulng and evoluonary compuaon. Evaluaon Index Table 5. The comparson beween he manual and enre shf-ables. Manual Shf- Table Enre Shf-Table No evenng-day-evenng-day shfs on any four consecuve days (number of volaons). 0 0 No day-overngh-off shfs on any hree consecuve days (number of volaons). 4 0 No evenng-overngh-off shfs on any hree consecuve days (number of volaons). 3 0 No overngh-off-overngh shfs on any hree consecuve days (number of volaons). 0 0 Machng he preferred enave shf-able (number of volaons). 2 0 The oal exceed numbers over he requred evenng shfs for all nursng saff. 6 0 The oal exceed numbers over he requred overngh shfs for all nursng saff. 6 0 Sasfyng day-shf needs (number of volaons). 0 0 Mananng mnmum labor requremens regardng evenng shfs (number of volaons). 0 0 Mananng mnmum labor requremens regardng overngh shfs (number of volaons). 0 0 Ensurng here are no overngh-day shfs on any wo consecuve days (number of volaons). 0 0 Tme scheduled 2-3 workdays (sec.) 514
13 C.-C. Tsa, C.-J. Lee / Asa Pacfc Managemen Revew 15(4) (2010) References Abbo, M.E. (1995) Measurng he effecs of a self-schedulng commee. Nursng Managemen, 26(9), 64a-64g. Ahuja, H., Sheppard, R. (1975) Compuerzed nurse schedulng. Indusral Engneerng, 7(10), Ackeln, U., Dowsland, K. (2000) Explong problem srucure n a genec algorhm approach o a nurse roserng problem. Journal of Schedulng, 3(3), Ackeln, U., L, J. (2006) Bayesan Opmzaon Algorhm for Nurse Schedulng. In Scalable Opmzaon va Probablsc Modelng: From Algorhms o Applcaons, Pelcan, M., Sasry, K., Canú-Paz, E. (eds), Sprnger, New York, pp Arher, J.L., Ravndran, A. (1981) A mulple objecve nurse schedulng model. AIIE Transacon, 13(1), Azaez, M.N., Sharf, S.S. (2005) A 0-1 goal programmng model for nurse schedulng. Compuers and Operaons Research, 32(3), Baley, J. (1985) Inegraed days off and shf personnel schedulng. Compuer and Operaons Research, 9(4), Bard, J.F., Purnomo, H.W. (2007) Cyclc preference schedulng of nurses usng a lagranganbased heursc. Journal of Schedulng, 10(1), Belzhoover, M. (1994) An nnovave approach for he self-schedulng. Nursng Managemen, 25(4), Bell, P.C., Hay, G., Lang, Y. (1986) A vsual neracve decson suppor sysem for workforce (nurse) schedulng. INFOR, 24(2), Brge, J., Seme, F., Vovor, T. (1998) A generalzed lnear programmng model for nurse schedulng. European Journal of Operaonal Research, 107(1), Burke, E.K., Causmaecker, P.D., Perovc, S., Berghe, G.V. (2006) Mea-heurscs for handlng me nerval coverage consrans n nurse schedulng. Appled Arfcal Inellgence, 20(9), Cheang, B., L, H., Lm, A., Rodrgues, B. (2003) Nurse roserng problems-a bblographc survey. European Journal of Operaonal Research, 151(3), Dmr, K. (2002) A Compeen Genec Algorhm for Solvng Permuaon and Schedulng. Kluwer Academc Publshers, Boson. Dowsland, K., Thompson, J.M. (2000) Solvng a nurse schedulng problem wh knapsacks, neworks and abu search. Journal of Operaonal Research Socey, 51, Ender, O. (2005) Memec algorhms for nurse roserng. Lecure noes n compuer scence, sprnger-verlag. The 20h Inernaonal Symposum on Compuer and Informaon Scences, 3733, Erns, A.T., Jang, H., Krshamoory, M., Owens, B., Ser, D. (2004) An annoaed bblography of personnel schedulng and roserng. Annals of Operaons Research, 127(1), Goldberg, D. E. (1989) Algorhms n Search. Opmzaon and Machne Learnng. Addsonwesley, Readng, MA. Harvey, H.M., Mona, K. (1998) Cyclc and non-cyclc schedulng of 12 h shf nurses by nework programmng. European Journal of Research, 104(3), Kosreva, M.M., Jennng, K.S.B. (1991) Nurse schedulng on a mcrocompuer. Compuers and Operaons Research, 18(8), Kosreva, M.M., Lescysk, M.D., Passn, F.T. (1978) The nurse schedulng decson va mxed-neger programmng. Proceedngs of Amercan Hospal Assocaon Forum on Nurse Schedulng, Amercan Hospal, USA,
14 C.-C. Tsa, C.-J. Lee / Asa Pacfc Managemen Revew 15(4) (2010) Meyer, aufm, Hofe, H. (2001) Solvng roserng asks as consran opmzaon. In Burke E. K., Erben, W. (Eds.) Pracce and Theory of Auomaed Tmeablng. 3rd Inernaonal Conference. Sprnger Lecure Noes n Compuer Scence, 2079(2001), Mller, H.E., Perskalla, W.P., Rah, G.J. (1976) Nurse schedulng usng mahemacal programmng. Operaon Reserch, 24(5), Musa, A.A., Saxena, U. (1984) Schedulng nurses usng goal-programmng echnques. IIE Transacons, 16(3), Ozkarahan, I., Baley, J.E. (1988) Goal programmng model subsysem of a flexble nurse schedulng suppor sysem. IIE Transacons, 20(3), Randhawa, S.U., Sompul, D. (1993) A heursc-based compuerzed nurse schedulng sysem. Compuers and Operaons Research, 20(8), Rondeau, K.V. (1990) Self-schedulng can ncrease job sasfacon. Medcal Laboraory Observer, 22(11), Sharf, M. (2000) Mulreservous sysems opmzaon genec algorhms: Case sudy. Journal of Compung n Cvl Engneerng, 14(4), Smh, L.D., Wggns, A. (1977) A compuer-based nurse schedulng sysem. Compuers and Operaons Research, 4(3), Warner, D.M. (1976) Schedulng nursng personnel accordng o nursng preference: A mahemacal programmng approach. Operaons Research, 24(5),
MULTI-WORKDAY ERGONOMIC WORKFORCE SCHEDULING WITH DAYS OFF
Proceedngs of he 4h Inernaonal Conference on Engneerng, Projec, and Producon Managemen (EPPM 203) MULTI-WORKDAY ERGONOMIC WORKFORCE SCHEDULING WITH DAYS OFF Tar Raanamanee and Suebsak Nanhavanj School
More informationCapacity Planning. Operations Planning
Operaons Plannng Capacy Plannng Sales and Operaons Plannng Forecasng Capacy plannng Invenory opmzaon How much capacy assgned o each producon un? Realsc capacy esmaes Sraegc level Moderaely long me horzon
More informationHow To Calculate Backup From A Backup From An Oal To A Daa
6 IJCSNS Inernaonal Journal of Compuer Scence and Nework Secury, VOL.4 No.7, July 04 Mahemacal Model of Daa Backup and Recovery Karel Burda The Faculy of Elecrcal Engneerng and Communcaon Brno Unversy
More informationGenetic Algorithm with Range Selection Mechanism for Dynamic Multiservice Load Balancing in Cloud-Based Multimedia System
ISSN : 2347-8446 (Onlne) Inernaonal Journal of Advanced Research n Genec Algorhm wh Range Selecon Mechansm for Dynamc Mulservce Load Balancng n Cloud-Based Mulmeda Sysem I Mchael Sadgun Rao Kona, II K.Purushoama
More informationMethodology of the CBOE S&P 500 PutWrite Index (PUT SM ) (with supplemental information regarding the CBOE S&P 500 PutWrite T-W Index (PWT SM ))
ehodology of he CBOE S&P 500 PuWre Index (PUT S ) (wh supplemenal nformaon regardng he CBOE S&P 500 PuWre T-W Index (PWT S )) The CBOE S&P 500 PuWre Index (cker symbol PUT ) racks he value of a passve
More informationPedro M. Castro Iiro Harjunkoski Ignacio E. Grossmann. Lisbon, Portugal Ladenburg, Germany Pittsburgh, USA
Pedro M. Casro Iro Harjunkosk Ignaco E. Grossmann Lsbon Porugal Ladenburg Germany Psburgh USA 1 Process operaons are ofen subjec o energy consrans Heang and coolng ules elecrcal power Avalably Prce Challengng
More informationLinear Extension Cube Attack on Stream Ciphers Abstract: Keywords: 1. Introduction
Lnear Exenson Cube Aack on Sream Cphers Lren Dng Yongjuan Wang Zhufeng L (Language Engneerng Deparmen, Luo yang Unversy for Foregn Language, Luo yang cy, He nan Provnce, 47003, P. R. Chna) Absrac: Basng
More informationBoosting for Learning Multiple Classes with Imbalanced Class Distribution
Boosng for Learnng Mulple Classes wh Imbalanced Class Dsrbuon Yanmn Sun Deparmen of Elecrcal and Compuer Engneerng Unversy of Waerloo Waerloo, Onaro, Canada y8sun@engmal.uwaerloo.ca Mohamed S. Kamel Deparmen
More informationGUIDANCE STATEMENT ON CALCULATION METHODOLOGY
GUIDANCE STATEMENT ON CALCULATION METHODOLOGY Adopon Dae: 9/28/0 Effecve Dae: //20 Reroacve Applcaon: No Requred www.gpssandards.org 204 CFA Insue Gudance Saemen on Calculaon Mehodology GIPS GUIDANCE STATEMENT
More informationSpline. Computer Graphics. B-splines. B-Splines (for basis splines) Generating a curve. Basis Functions. Lecture 14 Curves and Surfaces II
Lecure 4 Curves and Surfaces II Splne A long flexble srps of meal used by drafspersons o lay ou he surfaces of arplanes, cars and shps Ducks weghs aached o he splnes were used o pull he splne n dfferen
More informationEvent Based Project Scheduling Using Optimized Ant Colony Algorithm Vidya Sagar Ponnam #1, Dr.N.Geethanjali #2
Inernaonal Journal of Compuer Trends and Technology (IJCTT) Volume 18 Number 6 Dec 2014 Even Based Projec Schedulng Usng Opmzed An Colony Algorhm Vdya Sagar Ponnam #1, Dr.N.Geehanjal #2 1 Research Scholar,
More informationRESOLUTION OF THE LINEAR FRACTIONAL GOAL PROGRAMMING PROBLEM
Revsa Elecrónca de Comuncacones y Trabajos de ASEPUMA. Rec@ Volumen Págnas 7 a 40. RESOLUTION OF THE LINEAR FRACTIONAL GOAL PROGRAMMING PROBLEM RAFAEL CABALLERO rafael.caballero@uma.es Unversdad de Málaga
More informationThe Virtual Machine Resource Allocation based on Service Features in Cloud Computing Environment
Send Orders for Reprns o reprns@benhamscence.ae The Open Cybernecs & Sysemcs Journal, 2015, 9, 639-647 639 Open Access The Vrual Machne Resource Allocaon based on Servce Feaures n Cloud Compung Envronmen
More informationThe Rules of the Settlement Guarantee Fund. 1. These Rules, hereinafter referred to as "the Rules", define the procedures for the formation
Vald as of May 31, 2010 The Rules of he Selemen Guaranee Fund 1 1. These Rules, herenafer referred o as "he Rules", defne he procedures for he formaon and use of he Selemen Guaranee Fund, as defned n Arcle
More informationHEURISTIC ALGORITHM FOR SINGLE RESOURCE CONSTRAINED PROJECT SCHEDULING PROBLEM BASED ON THE DYNAMIC PROGRAMMING
Yugoslav Journal o Operaons Research Volume 19 (2009) Number 2, 281-298 DOI:10.2298/YUJOR0902281S HEURISTIC ALGORITHM FOR SINGLE RESOURCE CONSTRAINED PROJECT SCHEDULING PROBLEM BASED ON THE DYNAMIC PROGRAMMING
More informationMORE ON TVM, "SIX FUNCTIONS OF A DOLLAR", FINANCIAL MECHANICS. Copyright 2004, S. Malpezzi
MORE ON VM, "SIX FUNCIONS OF A DOLLAR", FINANCIAL MECHANICS Copyrgh 2004, S. Malpezz I wan everyone o be very clear on boh he "rees" (our basc fnancal funcons) and he "fores" (he dea of he cash flow model).
More informationA Hybrid Method for Forecasting Stock Market Trend Using Soft-Thresholding De-noise Model and SVM
A Hybrd Mehod for Forecasng Sock Marke Trend Usng Sof-Thresholdng De-nose Model and SVM Xueshen Su, Qnghua Hu, Daren Yu, Zongxa Xe, and Zhongyng Q Harbn Insue of Technology, Harbn 150001, Chna Suxueshen@Gmal.com
More informationAn Anti-spam Filter Combination Framework for Text-and-Image Emails through Incremental Learning
An An-spam Fler Combnaon Framework for Tex-and-Image Emals hrough Incremenal Learnng 1 Byungk Byun, 1 Chn-Hu Lee, 2 Seve Webb, 2 Danesh Iran, and 2 Calon Pu 1 School of Elecrcal & Compuer Engr. Georga
More informationCooperative Distributed Scheduling for Storage Devices in Microgrids using Dynamic KKT Multipliers and Consensus Networks
Cooperave Dsrbued Schedulng for Sorage Devces n Mcrogrds usng Dynamc KK Mulplers and Consensus Newors Navd Rahbar-Asr Yuan Zhang Mo-Yuen Chow Deparmen of Elecrcal and Compuer Engneerng Norh Carolna Sae
More informationPerfCenter: A Methodology and Tool for Performance Analysis of Application Hosting Centers
PerfCener: A Mehodology and Tool for Performance Analyss of Applcaon Hosng Ceners Rukma P. Verlekar, Varsha Ape, Prakhar Goyal, Bhavsh Aggarwal Dep. of Compuer Scence and Engneerng Indan Insue of Technology
More information12/7/2011. Procedures to be Covered. Time Series Analysis Using Statgraphics Centurion. Time Series Analysis. Example #1 U.S.
Tme Seres Analyss Usng Sagraphcs Cenuron Nel W. Polhemus, CTO, SaPon Technologes, Inc. Procedures o be Covered Descrpve Mehods (me sequence plos, auocorrelaon funcons, perodograms) Smoohng Seasonal Decomposon
More informationHEAT CONDUCTION PROBLEM IN A TWO-LAYERED HOLLOW CYLINDER BY USING THE GREEN S FUNCTION METHOD
Journal of Appled Mahemacs and Compuaonal Mechancs 3, (), 45-5 HEAT CONDUCTION PROBLEM IN A TWO-LAYERED HOLLOW CYLINDER BY USING THE GREEN S FUNCTION METHOD Sansław Kukla, Urszula Sedlecka Insue of Mahemacs,
More informationAnomaly Detection in Network Traffic Using Selected Methods of Time Series Analysis
I. J. Compuer Nework and Informaon Secury, 2015, 9, 10-18 Publshed Onlne Augus 2015 n MECS (hp://www.mecs-press.org/) DOI: 10.5815/jcns.2015.09.02 Anomaly Deecon n Nework Traffc Usng Seleced Mehods of
More informationHow Much Life Insurance is Enough?
How Much Lfe Insurance s Enough? Uly-Based pproach By LJ Rossouw BSTRCT The paper ams o nvesgae how much lfe nsurance proecon cover a uly maxmsng ndvdual should buy. Ths queson s relevan n he nsurance
More informationCONTROLLER PERFORMANCE MONITORING AND DIAGNOSIS. INDUSTRIAL PERSPECTIVE
Copyrgh IFAC 5h Trennal World Congress, Barcelona, Span CONTROLLER PERFORMANCE MONITORING AND DIAGNOSIS. INDUSTRIAL PERSPECTIVE Derrck J. Kozub Shell Global Soluons USA Inc. Weshollow Technology Cener,
More informationThe Multi-shift Vehicle Routing Problem with Overtime
The Mul-shf Vehcle Roung Problem wh Overme Yngao Ren, Maged Dessouy, and Fernando Ordóñez Danel J. Epsen Deparmen of Indusral and Sysems Engneerng Unversy of Souhern Calforna 3715 McClnoc Ave, Los Angeles,
More informationAnalyzing Energy Use with Decomposition Methods
nalyzng nergy Use wh Decomposon Mehods eve HNN nergy Technology Polcy Dvson eve.henen@ea.org nergy Tranng Week Pars 1 h prl 213 OCD/ 213 Dscusson nergy consumpon and energy effcency? How can energy consumpon
More informationUsing Cellular Automata for Improving KNN Based Spam Filtering
The Inernaonal Arab Journal of Informaon Technology, Vol. 11, No. 4, July 2014 345 Usng Cellular Auomaa for Improvng NN Based Spam Flerng Faha Bargou, Bouzane Beldjlal, and Baghdad Aman Compuer Scence
More informationAn Architecture to Support Distributed Data Mining Services in E-Commerce Environments
An Archecure o Suppor Dsrbued Daa Mnng Servces n E-Commerce Envronmens S. Krshnaswamy 1, A. Zaslavsky 1, S.W. Loke 2 School of Compuer Scence & Sofware Engneerng, Monash Unversy 1 900 Dandenong Road, Caulfeld
More informationKalman filtering as a performance monitoring technique for a propensity scorecard
Kalman flerng as a performance monorng echnque for a propensy scorecard Kaarzyna Bjak * Unversy of Souhampon, Souhampon, UK, and Buro Informacj Kredyowej S.A., Warsaw, Poland Absrac Propensy scorecards
More informationCLoud computing has recently emerged as a new
1 A Framework of Prce Bddng Confguraons for Resource Usage n Cloud Compung Kenl L, Member, IEEE, Chubo Lu, Keqn L, Fellow, IEEE, and Alber Y. Zomaya, Fellow, IEEE Absrac In hs paper, we focus on prce bddng
More informationDEPARTMENT OF ECONOMETRICS AND BUSINESS STATISTICS. Exponential Smoothing for Inventory Control: Means and Variances of Lead-Time Demand
ISSN 440-77X ISBN 0 736 094 X AUSTRALIA DEPARTMENT OF ECONOMETRICS AND BUSINESS STATISTICS Exponenal Smoohng for Invenory Conrol: Means and Varances of Lead-Tme Demand Ralph D. Snyder, Anne B. Koehler,
More informationSPC-based Inventory Control Policy to Improve Supply Chain Dynamics
Francesco Cosanno e al. / Inernaonal Journal of Engneerng and Technology (IJET) SPC-based Invenory Conrol Polcy o Improve Supply Chan ynamcs Francesco Cosanno #, Gulo Gravo #, Ahmed Shaban #3,*, Massmo
More informationMarket-Clearing Electricity Prices and Energy Uplift
Marke-Clearng Elecrcy Prces and Energy Uplf Paul R. Grbk, Wllam W. Hogan, and Susan L. Pope December 31, 2007 Elecrcy marke models requre energy prces for balancng, spo and shor-erm forward ransacons.
More informationAn Ensemble Data Mining and FLANN Combining Short-term Load Forecasting System for Abnormal Days
JOURNAL OF SOFTWARE, VOL. 6, NO. 6, JUNE 0 96 An Ensemble Daa Mnng and FLANN Combnng Shor-erm Load Forecasng Sysem for Abnormal Days Mng L College of Auomaon, Guangdong Unversy of Technology, Guangzhou,
More informationGuidelines and Specification for the Construction and Maintenance of the. NASDAQ OMX Credit SEK Indexes
Gudelnes and Specfcaon for he Consrucon and Manenance of he NASDAQ OMX Cred SEK Indexes Verson as of Aprl 7h 2014 Conens Rules for he Consrucon and Manenance of he NASDAQ OMX Cred SEK Index seres... 3
More informationBoth human traders and algorithmic
Shuhao Chen s a Ph.D. canddae n sascs a Rugers Unversy n Pscaaway, NJ. bhmchen@sa.rugers.edu Rong Chen s a professor of Rugers Unversy n Pscaaway, NJ and Peng Unversy, n Bejng, Chna. rongchen@sa.rugers.edu
More informationCost- and Energy-Aware Load Distribution Across Data Centers
- and Energy-Aware Load Dsrbuon Across Daa Ceners Ken Le, Rcardo Banchn, Margare Maronos, and Thu D. Nguyen Rugers Unversy Prnceon Unversy Inroducon Today, many large organzaons operae mulple daa ceners.
More informationIndex Mathematics Methodology
Index Mahemacs Mehodology S&P Dow Jones Indces: Index Mehodology Ocober 2015 Table of Conens Inroducon 4 Dfferen Varees of Indces 4 The Index Dvsor 5 Capalzaon Weghed Indces 6 Defnon 6 Adjusmens o Share
More informationA robust optimisation approach to project scheduling and resource allocation. Elodie Adida* and Pradnya Joshi
In. J. Servces Operaons and Informacs, Vol. 4, No. 2, 2009 169 A robus opmsaon approach o projec schedulng and resource allocaon Elode Adda* and Pradnya Josh Deparmen of Mechancal and Indusral Engneerng,
More informationExpiration-day effects, settlement mechanism, and market structure: an empirical examination of Taiwan futures exchange
Invesmen Managemen and Fnancal Innovaons, Volume 8, Issue 1, 2011 Cha-Cheng Chen (Tawan), Su-Wen Kuo (Tawan), Chn-Sheng Huang (Tawan) Expraon-day effecs, selemen mechansm, and marke srucure: an emprcal
More informationSHIPPING ECONOMIC ANALYSIS FOR ULTRA LARGE CONTAINERSHIP
Journal of he Easern Asa Socey for Transporaon Sudes, Vol. 6, pp. 936-951, 2005 SHIPPING ECONOMIC ANALYSIS FOR ULTRA LARGE CONTAINERSHIP Chaug-Ing HSU Professor Deparen of Transporaon Technology and Manageen
More informationA Heuristic Solution Method to a Stochastic Vehicle Routing Problem
A Heursc Soluon Mehod o a Sochasc Vehcle Roung Problem Lars M. Hvaum Unversy of Bergen, Bergen, Norway. larsmh@.ub.no Arne Løkkeangen Molde Unversy College, 6411 Molde, Norway. Arne.Lokkeangen@hmolde.no
More informationA Background Layer Model for Object Tracking through Occlusion
A Background Layer Model for Obec Trackng hrough Occluson Yue Zhou and Ha Tao Deparmen of Compuer Engneerng Unversy of Calforna, Sana Cruz, CA 95064 {zhou,ao}@soe.ucsc.edu Absrac Moon layer esmaon has
More informationA Reverse Logistics Model for the Distribution of Waste/By-products. Hamid Pourmohammadi, Maged Dessouky*, and Mansour Rahimi
A Reverse Logscs Model for he Dsrbuon of Wase/By-producs Hamd Pourmohammad, Maged Dessouy*, and Mansour Rahm Unversy of Souhern Calforna Epsen Deparmen of Indusral and Sysems Engneerng 375 McClnoc Avenue,
More informationCase Study on Web Service Composition Based on Multi-Agent System
900 JOURNAL OF SOFTWARE, VOL. 8, NO. 4, APRIL 2013 Case Sudy on Web Servce Composon Based on Mul-Agen Sysem Shanlang Pan Deparmen of Compuer Scence and Technology, Nngbo Unversy, Chna PanShanLang@gmal.com
More informationLecture 40 Induction. Review Inductors Self-induction RL circuits Energy stored in a Magnetic Field
ecure 4 nducon evew nducors Self-nducon crcus nergy sored n a Magnec Feld 1 evew nducon end nergy Transfers mf Bv Mechancal energy ransform n elecrc and hen n hermal energy P Fv B v evew eformulaon of
More informationPARTICLE FILTER BASED VEHICLE TRACKING APPROACH WITH IMPROVED RESAMPLING STAGE
ISS: 0976-910(OLIE) ICTACT JOURAL O IMAGE AD VIDEO PROCESSIG, FEBRUARY 014, VOLUME: 04, ISSUE: 03 PARTICLE FILTER BASED VEHICLE TRACKIG APPROACH WITH IMPROVED RESAMPLIG STAGE We Leong Khong 1, We Yeang
More informationProceedings of the 2008 Winter Simulation Conference S. J. Mason, R. R. Hill, L. Mönch, O. Rose, T. Jefferson, J. W. Fowler eds.
Proceedngs of he 008 Wner Smulaon Conference S. J. Mason, R. R. Hll, L. Mönch, O. Rose, T. Jefferson, J. W. Fowler eds. DEMAND FORECAST OF SEMICONDUCTOR PRODUCTS BASED ON TECHNOLOGY DIFFUSION Chen-Fu Chen,
More informationGround rules. Guide to the calculation methods of the FTSE Actuaries UK Gilts Index Series v1.9
Ground rules Gude o he calculaon mehods of he FTSE Acuares UK Gls Index Seres v1.9 fserussell.com Ocober 2015 Conens 1.0 Inroducon... 4 1.1 Scope... 4 1.2 FTSE Russell... 5 1.3 Overvew of he calculaons...
More informationHAND: Highly Available Dynamic Deployment Infrastructure for Globus Toolkit 4
HAND: Hghly Avalable Dynamc Deploymen Infrasrucure for Globus Toolk 4 L Q 1, Ha Jn 1, Ian Foser,3, Jarek Gawor 1 Huazhong Unversy of Scence and Technology, Wuhan, 430074, Chna quck@chnagrd.edu.cn; hjn@hus.edu.cn
More informationINTERNATIONAL JOURNAL OF STRATEGIC MANAGEMENT
IJSM, Volume, Number, 0 ISSN: 555-4 INTERNATIONAL JOURNAL OF STRATEGIC MANAGEMENT SPONSORED BY: Angelo Sae Unversy San Angelo, Texas, USA www.angelo.edu Managng Edors: Professor Alan S. Khade, Ph.D. Calforna
More informationPreface. Frederick D. Wolf Director, Accounting and Financial Management Division
f Preface The hallmark of a professonal audor s a commmen o connued self-developmen. As new and challengng problems and ssues confron us, we mus respond by sharpenng and expandng our echncal experse, analycal
More informationEstimating intrinsic currency values
Cung edge Foregn exchange Esmang nrnsc currency values Forex marke praconers consanly alk abou he srenghenng or weakenng of ndvdual currences. In hs arcle, Jan Chen and Paul Dous presen a new mehodology
More informationFRAMEWORK OF MEETING SCHEDULING IN COMPUTER SYSTEMS
FRAMEWORK OF MEEING CEDULING IN COMPUER YEM Goran Marnovc, Faculy of Elecrcal Engneerng, J.J. rossmayer Unversy of Ose, goran.marnovc@efos.hr ABRAC Developmen of compuer echnologes s a necessary bu no
More informationCurrency Exchange Rate Forecasting from News Headlines
Currency Exchange Rae Forecasng from News Headlnes Desh Peramunelleke Raymond K. Wong School of Compuer Scence & Engneerng Unversy of New Souh Wales Sydney, NSW 2052, Ausrala deshp@cse.unsw.edu.au wong@cse.unsw.edu.au
More informationNetwork Effects on Standard Software Markets: A Simulation Model to examine Pricing Strategies
Nework Effecs on Sandard Sofware Markes Page Nework Effecs on Sandard Sofware Markes: A Smulaon Model o examne Prcng Sraeges Peer Buxmann Absrac Ths paper examnes sraeges of sandard sofware vendors, n
More informationA Hybrid AANN-KPCA Approach to Sensor Data Validation
Proceedngs of he 7h WSEAS Inernaonal Conference on Appled Informacs and Communcaons, Ahens, Greece, Augus 4-6, 7 85 A Hybrd AANN-KPCA Approach o Sensor Daa Valdaon REZA SHARIFI, REZA LANGARI Deparmen of
More informationApplying the Theta Model to Short-Term Forecasts in Monthly Time Series
Applyng he Thea Model o Shor-Term Forecass n Monhly Tme Seres Glson Adamczuk Olvera *, Marcelo Gonçalves Trenn +, Anselmo Chaves Neo ** * Deparmen of Mechancal Engneerng, Federal Technologcal Unversy of
More informationY2K* Stephanie Schmitt-Grohé. Rutgers Uni ersity, 75 Hamilton Street, New Brunswick, New Jersey 08901 E-mail: grohe@econ.rutgers.edu.
Revew of Economc Dynamcs 2, 850856 Ž 1999. Arcle ID redy.1999.0065, avalable onlne a hp:www.dealbrary.com on Y2K* Sephane Schm-Grohé Rugers Unersy, 75 Hamlon Sree, New Brunswc, New Jersey 08901 E-mal:
More informationThe Definition and Measurement of Productivity* Mark Rogers
The Defnon and Measuremen of Producvy* Mark Rogers Melbourne Insue of Appled Economc and Socal Research The Unversy of Melbourne Melbourne Insue Workng Paper No. 9/98 ISSN 1328-4991 ISBN 0 7325 0912 6
More informationA 3D Model Retrieval System Using The Derivative Elevation And 3D-ART
3 Model Rereal Sysem Usng he erae leaon nd 3-R Jau-Lng Shh* ng-yen Huang Yu-hen Wang eparmen of ompuer Scence and Informaon ngneerng hung Hua Unersy Hsnchu awan RO -mal: sjl@chueduw bsrac In recen years
More informationAttribution Strategies and Return on Keyword Investment in Paid Search Advertising
Arbuon Sraeges and Reurn on Keyword Invesmen n Pad Search Adversng by Hongshuang (Alce) L, P. K. Kannan, Sva Vswanahan and Abhshek Pan * December 15, 2015 * Honshuang (Alce) L s Asssan Professor of Markeng,
More informationAn Optimisation-based Approach for Integrated Water Resources Management
20 h Euroean Symosum on Comuer Aded Process Engneerng ESCAPE20 S Perucc and G Buzz Ferrars (Edors) 2010 Elsever BV All rghs reserved An Omsaon-based Aroach for Inegraed Waer Resources Managemen Songsong
More informationII. IMPACTS OF WIND POWER ON GRID OPERATIONS
IEEE Energy2030 Alana, Georga, USA 17-18 November 2008 Couplng Wnd Generaors wh eferrable Loads A. Papavaslou, and S. S. Oren UC Berkeley, eparmen of Indusral Engneerng and Operaons esearch, 4141 Echeverry
More informationRevision: June 12, 2010 215 E Main Suite D Pullman, WA 99163 (509) 334 6306 Voice and Fax
.3: Inucors Reson: June, 5 E Man Sue D Pullman, WA 9963 59 334 636 Voce an Fax Oerew We connue our suy of energy sorage elemens wh a scusson of nucors. Inucors, lke ressors an capacors, are passe wo-ermnal
More informationDistribution Channel Strategy and Efficiency Performance of the Life insurance. Industry in Taiwan. Abstract
Dsrbuon Channel Sraegy and Effcency Performance of he Lfe nsurance Indusry n Tawan Absrac Changes n regulaons and laws he pas few decades have afeced Tawan s lfe nsurance ndusry and caused many nsurers
More informationSocial security, education, retirement and growth*
Hacenda P úblca Espa ñola / Revsa de Econom ía P úblca, 198-(3/2011): 9-36 2011, Insuo de Esudos Fscales Socal secury, educaon, reremen and growh* CRUZ A. ECHEVARR ÍA AMAIA IZA** Unversdad del Pa ís Vasco
More informationTime Series. A thesis. Submitted to the. Edith Cowan University. Perth, Western Australia. David Sheung Chi Fung. In Fulfillment of the Requirements
Mehods for he Esmaon of Mssng Values n Tme Seres A hess Submed o he Faculy of Communcaons, ealh and Scence Edh Cowan Unversy Perh, Wesern Ausrala By Davd Sheung Ch Fung In Fulfllmen of he Requremens For
More informationThe Prediction Algorithm Based on Fuzzy Logic Using Time Series Data Mining Method
The Predcon Algorhm Based on Fuzzy Logc Usng Tme Seres Daa Mnng Mehod I Aydn, M Karakose, and E Akn Asrac Predcon of an even a a me seres s que mporan for engneerng and economy prolems Tme seres daa mnng
More informationDistributed Load Balancing in a Multiple Server System by Shift-Invariant Protocol Sequences
03 IEEE Wreess Communcaons and Neorkng Conference (WCNC): NETWORS Dsrbued Load Baancng n a Mupe Server Sysem by Shf-Invaran rooco Sequences Yupeng Zhang and Wng Shng Wong Deparmen of Informaon Engneerng
More informationMonopolistic Competition and Macroeconomic Dynamics
Monopolsc Compeon and Macroeconomc Dynamcs Pasquale Commendaore, Unversà d Napol Federco II Ingrd Kubn, Venna Unversy of Economcs and Busness Admnsraon Absrac Modern macroeconomc models wh a Keynesan flavor
More informationLevy-Grant-Schemes in Vocational Education
Levy-Gran-Schemes n Vocaonal Educaon Sefan Bornemann Munch Graduae School of Economcs Inernaonal Educaonal Economcs Conference Taru, Augus 26h, 2005 Sefan Bornemann / MGSE Srucure Movaon and Objecve Leraure
More informationAPPLICATION OF CHAOS THEORY TO ANALYSIS OF COMPUTER NETWORK TRAFFIC Liudvikas Kaklauskas, Leonidas Sakalauskas
The XIII Inernaonal Conference Appled Sochasc Models and Daa Analyss (ASMDA-2009) June 30-July 3 2009 Vlnus LITHUANIA ISBN 978-9955-28-463-5 L. Sakalauskas C. Skadas and E. K. Zavadskas (Eds.): ASMDA-2009
More informationScaling Up POMDPs for Dialog Management: The Summary POMDP Method. Jason D. Williams and Steve Young
Scalng Up POMDPs for Dalog Managemen: The Summary POMDP Mehod Jason D. Wllams and Seve Young Cambrdge Unversy Engneerng Deparmen Trumpngon Sree, Cambrdge CB2 1PZ, UK jdw30@cam.ac.uk sjy@eng.cam.ac.uk BSTRCT
More informationA Real-time Adaptive Traffic Monitoring Approach for Multimedia Content Delivery in Wireless Environment *
A Real-e Adapve Traffc Monorng Approach for Muleda Conen Delvery n Wreless Envronen * Boonl Adpa and DongSong Zhang Inforaon Syses Deparen Unversy of Maryland, Balore Couny Balore, MD, U.S.A. bdpa1@ubc.edu,
More informationTowards a Trustworthy and Controllable Peer- Server-Peer Media Streaming: An Analytical Study and An Industrial Perspective
Towards a Trusworhy and Conrollable Peer- Server-Peer Meda Sreamn: An Analycal Sudy and An Indusral Perspecve Zhja Chen, Hao Yn, Chuan n, Xuenn u, Yan Chen* Deparmen of Compuer Scence & Technoloy, *Deparmen
More informationA binary powering Schur algorithm for computing primary matrix roots
Numercal Algorhms manuscr No. (wll be nsered by he edor) A bnary owerng Schur algorhm for comung rmary marx roos Federco Greco Bruno Iannazzo Receved: dae / Acceed: dae Absrac An algorhm for comung rmary
More informationGlobal supply chain planning for pharmaceuticals
chemcal engneerng research and desgn 8 9 (2 0 1 1) 2396 2409 Conens lss avalable a ScenceDrec Chemcal Engneerng Research and Desgn journal homepage: www.elsever.com/locae/cherd Global supply chan plannng
More informationSelected Financial Formulae. Basic Time Value Formulae PV A FV A. FV Ad
Basc Tme Value e Fuure Value of a Sngle Sum PV( + Presen Value of a Sngle Sum PV ------------------ ( + Solve for for a Sngle Sum ln ------ PV -------------------- ln( + Solve for for a Sngle Sum ------
More informationThe Incentive Effects of Organizational Forms: Evidence from Florida s Non-Emergency Medicaid Transportation Programs
The Incenve Effecs of Organzaonal Forms: Evdence from Florda s Non-Emergency Medcad Transporaon Programs Chfeng Da* Deparmen of Economcs Souhern Illnos Unversy Carbondale, IL 62901 Davd Denslow Deparmen
More informationTHE USE IN BANKS OF VALUE AT RISK METHOD IN MARKET RISK MANAGEMENT. Ioan TRENCA *
ANALELE ŞTIINłIFICE ALE UNIVERSITĂłII ALEXANDRU IOAN CUZA DIN IAŞI Tomul LVI ŞnŃe Economce 009 THE USE IN BANKS OF VALUE AT RISK METHOD IN MARKET RISK MANAGEMENT Ioan TRENCA * Absrac In sophscaed marke
More informationANALYSIS OF SOURCE LOCATION ALGORITHMS Part I: Overview and non-iterative methods
ANALYSIS OF SOURCE LOCATION ALGORITHMS Par I: Overvew and non-erave mehods MAOCHEN GE Pennsylvana Sae Unversy, Unversy Park PA 1680 Absrac Ths arcle and he accompanyng one dscuss he source locaon heores
More informationNonlinearity or Structural Break? - Data Mining in Evolving Financial Data Sets from a Bayesian Model Combination Perspective
Proceedngs of he 38h Hawa Inernaonal Conference on Sysem Scences - 005 Nonlneary or Srucural Break? - Daa Mnng n Evolvng Fnancal Daa Ses from a Bayesan Model Combnaon Perspecve Hao Davd Zhou Managemen
More informationInventory Management MILP Modeling for Tank Farm Systems
2 h European Sympoum on Compuer Aded Proce Engneerng ESCAPE2 S. Perucc and G. Buzz Ferrar (Edor) 2 Elever B.V. All rgh reerved. Invenory Managemen MILP Modelng for Tank Farm Syem Suana Relva a Ana Paula
More informationGround rules. FTSE Global Bonds Index Series v1.7
Ground rules FTSE Global Bonds Index Seres v.7 fserussell.com Ocober 205 Conens.0 Inroducon... 3 2.0 Managemen responsbles... 7 3.0 Elgble of secures... 9 4.0 rce sources... 5.0 erodc Change o he orfolos...
More information(Im)possibility of Safe Exchange Mechanism Design
(Im)possbly of Safe Exchange Mechansm Desgn Tuomas Sandholm Compuer Scence Deparmen Carnege Mellon Unversy 5 Forbes Avenue Psburgh, PA 15213 sandholm@cs.cmu.edu XaoFeng Wang Deparmen of Elecrcal and Compuer
More informationOmar Shatnawi. Eks p l o a t a c j a i Ni e z a w o d n o s c Ma in t e n a n c e a n d Reliability Vo l.16, No. 4, 2014 585. 1.
Arcle caon nfo: Shanaw O. Measurng commercal sofware operaonal relably: an nerdscplnary modellng approach. Esploaacja Nezawodnosc Manenance and Relably 014; 16 (4): 585 594. Omar Shanaw Measurng commercal
More informationA Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting*
journal of compuer and sysem scences 55, 119139 (1997) arcle no. SS971504 A Decson-heorec Generalzaon of On-Lne Learnng and an Applcaon o Boosng* Yoav Freund and Rober E. Schapre - A6 Labs, 180 Park Avenue,
More informationProt sharing: a stochastic control approach.
Pro sharng: a sochasc conrol approach. Donaen Hanau Aprl 2, 2009 ESC Rennes. 35065 Rennes, France. Absrac A majory of lfe nsurance conracs encompass a guaraneed neres rae and a parcpaon o earnngs of he
More informationMODEL-BASED APPROACH TO CHARACTERIZATION OF DIFFUSION PROCESSES VIA DISTRIBUTED CONTROL OF ACTUATED SENSOR NETWORKS
MODEL-BASED APPROACH TO CHARACTERIZATION OF DIFFUSION PROCESSES IA DISTRIBUTED CONTROL OF ACTUATED SENSOR NETWORKS Kevn L. Moore and YangQuan Chen Cener for Self-Organzng and Inellgen Sysems Uah Sae Unversy
More informationAn Introductory Study on Time Series Modeling and Forecasting
An Inroducory Sudy on Tme Seres Modelng and Forecasng Ranadp Adhkar R. K. Agrawal ACKNOWLEDGEMENT The mely and successful compleon of he book could hardly be possble whou he helps and suppors from a lo
More informationLinear methods for regression and classification with functional data
Lnear mehods for regresson and classfcaon wh funconal daa Glber Sapora Chare de Sasue Appluée & CEDRIC Conservaore Naonal des Ars e Méers 9 rue San Marn, case 44 754 Pars cedex 3, France sapora@cnam.fr
More informationA GENERALIZED FRAMEWORK FOR CREDIT RISK PORTFOLIO MODELS
A GENERALIZED FRAMEWORK FOR CREDIT RISK PORTFOLIO MODELS H. UGUR KOYLUOGLU ANDREW HICKMAN Olver, Wyman & Company CSFP Capal, Inc. * 666 Ffh Avenue Eleven Madson Avenue New Yor, New Yor 10103 New Yor, New
More informationAnalysis of intelligent road network, paradigm shift and new applications
CONFERENCE ABOUT THE STATUS AND FUTURE OF THE EDUCATIONAL AND R&D SERVICES FOR THE VEHICLE INDUSTRY Analyss of nellgen road nework, paradgm shf and new applcaons Péer Tamás "Smarer Transpor" - IT for co-operave
More informationInsurance. By Mark Dorfman, Alexander Kling, and Jochen Russ. Abstract
he Impac Of Deflaon On Insurance Companes Offerng Parcpang fe Insurance y Mar Dorfman, lexander Klng, and Jochen Russ bsrac We presen a smple model n whch he mpac of a deflaonary economy on lfe nsurers
More informationStructural jump-diffusion model for pricing collateralized debt obligations tranches
Appl. Mah. J. Chnese Unv. 010, 54): 40-48 Srucural jump-dffuson model for prcng collaeralzed deb oblgaons ranches YANG Ru-cheng Absrac. Ths paper consders he prcng problem of collaeralzed deb oblgaons
More informationLoad Balancing in Internet Using Adaptive Packet Scheduling and Bursty Traffic Splitting
152 IJCSNS Inernaonal Journal of Compuer Scence and Nework Secury, VOL.8 No.1, Ocober 28 Load Balancng n Inerne Usng Adapve Packe Schedulng and Bursy Traffc Splng M. Azah Research Scholar, Anna Unversy,
More informationWilmar Deliverable D6.2 (b) Wilmar Joint Market Model Documentation. Peter Meibom, Helge V. Larsen, Risoe National Laboratory
Rsø-R-1552(EN) Wlmar Delverable D6.2 (b) Wlmar Jon Marke Model Documenaon Peer Mebom, Helge V. Larsen, Rsoe Naonal Laboraory Rüdger Barh, Heke Brand, IER, Unversy of Sugar Chrsoph Weber, Olver Voll, Unversy
More informationScientific Ontology Construction Based on Interval Valued Fuzzy Theory under Web 2.0
JOUNAL OF SOFTWAE, VOL. 8, NO. 8, AUGUST 2013 1835 Scenfc Onology Consrucon Based on Inerval Valued Fuzzy Theory under Web 2.0 Na Xue, Sulng Ja, Jnxng Hao and Qang Wang School of Economcs and Managemen,
More information