LEADER 01138nam0 22003011i 450 001 SUN0031216 005 20050131120000.0 010 $a01-982737-4-6 100 $a20041222d1993 |0engc50 ba 101 $aeng 102 $aGB 105 $a|||| ||||| 200 1 $aˆA ‰system of rights$fRex Martin 210 $aOxford$cClarendon press$aNew York$cOxford University press$d1993 215 $aVI, 439 p.$d25 cm. 606 $aDiritti civili e politici$2FI$3SUNC005032 620 $aUS$dNew York$3SUNL000011 620 $aGB$dOxford$3SUNL000020 676 $a323$cDiritti civili e politici.$v21 700 1$aMartin$b, Rex$3SUNV025840$0254444 712 $aOxford university$3SUNV000064$4650 712 $aClarendon$3SUNV000098$4650 801 $aIT$bSOL$c20181109$gRICA 912 $aSUN0031216 950 $aUFFICIO DI BIBLIOTECA DEL DIPARTIMENTO DI GIURISPRUDENZA$d00 CONS XXI.Eb.94 $e00 7950 995 $aUFFICIO DI BIBLIOTECA DEL DIPARTIMENTO DI GIURISPRUDENZA$h7950$kCONS XXI.Eb.94$op$qa 996 $aSystem of rights$9264781 997 $aUNICAMPANIA LEADER 01972nam 2200385 450 001 9910674029503321 005 20230623104559.0 035 $a(CKB)4100000011302174 035 $a(NjHacI)994100000011302174 035 $a(EXLCZ)994100000011302174 100 $a20230623d2020 uy 0 101 0 $aeng 135 $aur||||||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 00$aExact and Heuristic Scheduling Algorithms /$fedited by Frank Werner, Larysa Burtseva, Yuri Sotskov 210 1$aBasel :$cMDPI - Multidisciplinary Digital Publishing Institute,$d2020. 215 $a1 online resource (200 pages) 311 $a3-03928-468-1 330 $aThis edited book presents new results in the area of the development of exact and heuristic scheduling algorithms. It contains eight articles accepted for publication for a Special Issue in the journal Algorithms. The book presents new algorithms, e.g., for flow shop, job shop, and parallel machine scheduling problems. The particular articles address subjects such as a heuristic for the routing and scheduling problem with time windows, applied to the automotive industry in Mexico, a heuristic for the blocking job shop problem with tardiness minimization based on new neighborhood structures, fast heuristics for the Euclidean traveling salesman problem or a new mathematical model for the period-aggregated resource leveling problem with variable job duration, and several others. 606 $aComputer capacity$xManagement 606 $aComputer capacity$xPlanning 615 0$aComputer capacity$xManagement. 615 0$aComputer capacity$xPlanning. 676 $a004.24 702 $aWerner$b Frank 702 $aBurtseva$b Larysa 702 $aSotskov$b Yuri 801 0$bNjHacI 801 1$bNjHacl 906 $aBOOK 912 $a9910674029503321 996 $aExact and Heuristic Scheduling Algorithms$93057852 997 $aUNINA LEADER 01385nam 2200421 450 001 9910155093403321 005 20230808200836.0 010 $a1-4438-5850-1 035 $a(CKB)3710000000973288 035 $a(MiAaPQ)EBC4770329 035 $a(OCoLC)966287860 035 $a(FINmELB)ELB147144 035 $a(EXLCZ)993710000000973288 100 $a20170104h20162016 uy 0 101 0 $aeng 135 $aurcnu|||||||| 181 $2rdacontent 182 $2rdamedia 183 $2rdacarrier 200 00$aWomen rewriting boundaries $eVictorian women travel writers /$fedited by Precious McKenzie Stearns 210 1$aNewcastle-upon-Tyne, England :$cCambridge Scholars Publishing,$d2016. 210 4$d©2016 215 $a1 online resource (202 pages) 300 $aIncludes index. 311 $a1-4438-9731-0 606 $aEnglish prose literature$xWomen authors$xHistory and criticism 606 $aEnglish prose literature$y19th century$xHistory and criticism 615 0$aEnglish prose literature$xWomen authors$xHistory and criticism. 615 0$aEnglish prose literature$xHistory and criticism. 676 $a820.9928709033 702 $aStearns$b Precious McKenzie 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910155093403321 996 $aWomen rewriting boundaries$92784524 997 $aUNINA