Lebedinskaya, N. B. The minimization of the maximal penalty in the case of splittable jobs. (Russian) Zbl 0469.90038 Zap. Nauchn. Semin. Leningr. Otd. Mat. Inst. Steklova 102, 61-67 (1980). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 1 Review MSC: 90B35 Deterministic scheduling theory in operations research 65K05 Numerical mathematical programming methods 68Q25 Analysis of algorithms and problem complexity 90C90 Applications of mathematical programming Keywords:scheduling; n jobs; one machine; quasi-convex penalty functions; optimal schedule; minimal job penalties; splittable jobs PDFBibTeX XMLCite \textit{N. B. Lebedinskaya}, Zap. Nauchn. Semin. Leningr. Otd. Mat. Inst. Steklova 102, 61--67 (1980; Zbl 0469.90038) Full Text: EuDML