*001273645
*00520160622154827.0
*007ta
*008091016s2008    no#           000 u eng d
*00900959cam a2200241 c 4500
*019  $bl
*035  $a(EXLNZ-47BIBSYS_NETWORK)990806659854702201
*035  $a(NO-LaBS)15083727(bibid)
*035  $a(NO-TrBIB)080665985
*035  $a080665985-47bibsys_network
*040  $aNO-TrBIB$bnob$ekatreg
*044  $cno
*1001 $aBillaut, Jean-Charles$0(NO-TrBIB)8028890$_53652900
*24513$aAn improved approximation algorithm for the two-machine open shop scheduling problem with family setup times$cJean-Charles Billaut, Irina Gribkovskaia, Vitaly Strusevich
*260  $aMolde$bHøgskolen i Molde$c2008
*300  $aPp. 478-493
*4901 $aSærtrykk / Høgskolen i Molde$v2008:14
*500  $aSærtrykk av: IIE Transactions, 40(2008)nr. 4
*7001 $aGribkovskaia, Irina$d1958-$0(NO-TrBIB)1068946$_44111600
*7001 $aStrusevič, V.A.$d1957-$0(NO-TrBIB)90764233$_53653000
*830 0$aSærtrykk (Høgskolen i Molde : trykt utg.)$v2008:14$w990221826244702201$_13629000
*901  $a80
*999  $aoai:nb.bibsys.no:990806659854702202$b2021-11-14T20:06:34Z$z990806659854702202
^