scientific article; zbMATH DE number 3648417

MaRDI QIDQ3206646zbMATH OpenFDO

Authors Eugene L. Lawler

Publication date 1979

zbMATH Keywords

computational complexitydynamic programmingparallel machinespolynomial algorithmpreemptive schedulingfully polynomial approximation schemeuniform parallel machinespseudopolynomial algorithmNp-hardness

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39) Integer programming (90C10)

Cited in

(4)

• 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
• Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity
• Minimizing the number of late jobs on unrelated machines

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3206646)