两类带有分族工件的平行分批排序问题-运筹学与控制论专业论文.docxVIP

A b A b s t r a e t In th e p a ra llel一b a teh in g seh ed u lin g m o d el，a m a 乙h ine ea n p ro eess seve ra l jo b s sim u l- ta n e o u sly a s a b a teh . T h e P ro e e ssin g tim e o f th e b a teh 15 e q u a l to th e lo n g est P ro e e ssin g tim e o f th e jo b s assig n ed to it. W h en th e jo b s a re p ro eessed ，jo b s fro m d iffe rent fa，m ilies ea n n o t b e P la eed in th e sa m e b a tch . In th e o n 一lin e sch ed u lin g m o d el，a ll jo b in form a tio n a re u n k n ow n b efore th eir release d a tes，a n d o n ee a jo b 15 seh ed u led it ea n n o t b e eh a n g ed . In th is P a P e r ，we e o n sid e r two k in d s o f sch e d u lin g m o d e ls : (1) p arallel一m achine p arallel一b atehing seheduling w ith fam ily jobs an d release dates to m in im iz e m a k e sP a n ; (2) on一line seheduling w ith fam ily jobs and delivery tim e on a single b ateh ing m aehine· T h e m a in re su lts o f th is p a P e r a re a s follo w s : (1) Fo r th e seheduling m odel p }fal n jly二jobs，p 一乙a“动，rj，b 二}Cm ax，we give a p olynom ial一tim e approx im ation schem e (P J，A S ). (2) Fo r the seheduling m odel P }角J刀j乃，-jobs，p 一乙a亡ch ，马，乙= oo }Cnl ax，we give an im - p roved p oly nom ial一tim e ap p rox im ation seh em e (P T A S ). (3) Fo r the Scheduling m odel 11on一ljne，fal ”j厅寸。bs，p 一乙a亡cl1，弓，公，b = OO {L nlax，Woef g iv e a n o n - lin e a lg o rith m w ith c o m P e t it iv e r a t io n o t g re a t e r th a n 2 w h e n th e n u n ll〕e r fam ilieo f 15 a eon stan t; we give an o n 一lin e algo rith m w ith eo m P etitive ratio n o t g rea ter th an Z + ￡w h en th e n u m b er o f fam ilies f 15 arl〕itrary an d ‘15 a give n arb itra ry sm all P o s itiv e n u m b e r . (4) Fo r the Scheduling m odel l}on一line，角川jly-j obs，p 一乙a七动，aoreeable(玛，峪)，弓，b = oo }L m ax，w e give an on一line algorithm w ith eom p etitive ratio not greater th an 2 w hen the n u m b er of fam ilies f 15