02248nam0 2200445 i 450 VAN012480220230630091418.961N978331977528920191025d2018 |0itac50 baengCH|||| |||||Machine Scheduling to Minimize Weighted Completion TimesThe Use of the α-pointNicoló GusmeroliChamSpringer2018xi, 53 p.24 cm001VAN01025962001 SpringerBriefs in mathematics210 Berlin [etc.]SpringerVAN0236348Machine Scheduling to Minimize Weighted Completion Times156364268Q25Analysis of algorithms and problem complexity [MSC 2020]VANC019860MF68WxxAlgorithms in computer science [MSC 2020]VANC021296MF68M20Performance evaluation, queueing, and scheduling in the context of computer systems [MSC 2020]VANC024644MF90-XXOperations research, mathematical programming [MSC 2020]VANC025650MF90C27Combinatorial optimization [MSC 2020]VANC031074MF90B35Scheduling theory, deterministic in operations research [MSC 2020]VANC033687MF90C59Approximation methods and heuristics in mathematical programming [MSC 2020]VANC034026MFApproximation algorithmsKW:KLP-relaxationKW:KRelease datesKW:KScheduling theoryKW:Kα-pointKW:KCHChamVANL001889GusmeroliNicolóVANV096229767836Springer <editore>VANV108073650ITSOL20240614RICAhttp://doi.org/10.1007/978-3-319-77528-9E-book – Accesso al full-text attraverso riconoscimento IP di Ateneo, proxy e/o ShibbolethBIBLIOTECA DEL DIPARTIMENTO DI MATEMATICA E FISICAIT-CE0120VAN08NVAN0124802BIBLIOTECA DEL DIPARTIMENTO DI MATEMATICA E FISICA08CONS e-book 1225 08eMF1225 20191025 Machine Scheduling to Minimize Weighted Completion Times1563642UNICAMPANIA