scientific article
From MaRDI portal
Publication:3206646
zbMath0416.90035MaRDI QIDQ3206646
Publication date: 1979
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
computational complexitydynamic programmingparallel machinespolynomial algorithmpreemptive schedulingfully polynomial approximation schemeuniform parallel machinespseudopolynomial algorithmNp-hardness
Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)
Related Items
Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity, A graph-oriented approach for the minimization of the number of late jobs for the parallel machines scheduling problem, Preemptive parallel-machine scheduling problem of maximizing the number of on-time jobs, Minimizing the number of late jobs on unrelated machines