《1995 A more efficient Lagrangian relaxation approach to job-shop scheduling problems》.pdf

Weight, (valiie or iinport,a.nce) of jot) %; Set, of %res capable of performing oper:i,- t.ion ( i,j ) ; Set, of opera.tions of jol) .iimmediately precetl- ing operation( i ,j ) ; Processing time of opera.tion ( i ,j ) on machiiir 1 E A4,j; Chmp1et8ioiitjiine of operat,ioii ( i ,J); Mitcliiiie selected t,o process operation ( i ,j ) , nri,,i E Mz,,7i Tiiiie liorizon iiiitler coiisitleratioii; T-d.i(. 11Iiess ofjob i , tlefil-lrtl a.s max(0, c,- ni}; It, is assunied t,liii.t,f,lie precedeiic,e cmist,ra.iiit,sof it d acyclic graph arid, withoiit loss of geiieralit,y, t,lia.t,ex11 job