LEADER 01440nam--2200421---450- 001 990003333630203316 005 20091014122512.0 010 $a978-88-387-4681-8 035 $a000333363 035 $aUSA01000333363 035 $a(ALEPH)000333363USA01 035 $a000333363 100 $a20091014d2008----km-y0itay50------ba 101 $aita 102 $aIT 105 $a||||||||001yy 200 1 $aInfortuni sul lavoro : responsabilità penali e nuovo testo unico$esoggetti coinvolti, malattie professionali, estinzione del reato 205 $aaggiornato al D.Lgs. 9 aprile 2008, n. 81 (G.U. 30 aprile 2008, n. 101 - S.O. n. 108) 210 $aSantarcangelo di Romagna$cMaggioli$d2008 215 $a711 p.$d24 cm 225 2 $12001$aLegalePenale$v160 410 0$12001$aLegalePenale$v160 454 1$12001 461 1$1001-------$12001 606 0 $aInfortuni sul lavoro$xLegislazione$2BNCF 676 $a344.0465 700 1$aD'ANGELO,$bNicola$0284130 801 0$aIT$bsalbc$gISBD 912 $a990003333630203316 951 $aXXV.2.K. 119$b60900 G.$cXXV.2.K.$d00229027 959 $aBK 969 $aGIU 979 $aFIORELLA$b90$c20091014$lUSA01$h1222 979 $aFIORELLA$b90$c20091014$lUSA01$h1225 979 $aCHIARA$b90$c20140926$lUSA01$h1509 979 $aCHIARA$b90$c20151215$lUSA01$h1426 996 $aInfortuni sul lavoro : responsabilità penali e nuovo testo unico$91120834 997 $aUNISA LEADER 02248nam0 2200445 i 450 001 VAN0124802 005 20230630091418.961 017 70$2N$a9783319775289 100 $a20191025d2018 |0itac50 ba 101 $aeng 102 $aCH 105 $a|||| ||||| 200 1 $aMachine Scheduling to Minimize Weighted Completion Times$eThe Use of the ?-point$fNicoló Gusmeroli 210 $aCham$cSpringer$d2018 215 $axi, 53 p.$d24 cm 410 1$1001VAN0102596$12001 $aSpringerBriefs in mathematics$1210 $aBerlin [etc.]$cSpringer 500 1$3VAN0236348$aMachine Scheduling to Minimize Weighted Completion Times$91563642 606 $a68Q25$xAnalysis of algorithms and problem complexity [MSC 2020]$3VANC019860$2MF 606 $a68Wxx$xAlgorithms in computer science [MSC 2020]$3VANC021296$2MF 606 $a68M20$xPerformance evaluation, queueing, and scheduling in the context of computer systems [MSC 2020]$3VANC024644$2MF 606 $a90-XX$xOperations research, mathematical programming [MSC 2020]$3VANC025650$2MF 606 $a90C27$xCombinatorial optimization [MSC 2020]$3VANC031074$2MF 606 $a90B35$xScheduling theory, deterministic in operations research [MSC 2020]$3VANC033687$2MF 606 $a90C59$xApproximation methods and heuristics in mathematical programming [MSC 2020]$3VANC034026$2MF 610 $aApproximation algorithms$9KW:K 610 $aLP-relaxation$9KW:K 610 $aRelease dates$9KW:K 610 $aScheduling theory$9KW:K 610 $a?-point$9KW:K 620 $aCH$dCham$3VANL001889 700 1$aGusmeroli$bNicoló$3VANV096229$0767836 712 $aSpringer $3VANV108073$4650 801 $aIT$bSOL$c20240614$gRICA 856 4 $uhttp://doi.org/10.1007/978-3-319-77528-9$zE-book ? Accesso al full-text attraverso riconoscimento IP di Ateneo, proxy e/o Shibboleth 899 $aBIBLIOTECA DEL DIPARTIMENTO DI MATEMATICA E FISICA$1IT-CE0120$2VAN08 912 $fN 912 $aVAN0124802 950 $aBIBLIOTECA DEL DIPARTIMENTO DI MATEMATICA E FISICA$d08CONS e-book 1225 $e08eMF1225 20191025 996 $aMachine Scheduling to Minimize Weighted Completion Times$91563642 997 $aUNICAMPANIA