scientific article
From MaRDI portal
Publication:3962462
zbMath0497.68016MaRDI QIDQ3962462
Publication date: 1982
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
deterministic schedulingpreemptive schedulesuniform processorsmaximum lateness criterionpolymatroidal network flow
Deterministic scheduling theory in operations research (90B35) Deterministic network models in operations research (90B10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (3)
Parallel machine scheduling with machine availability and eligibility constraints ⋮ Scheduling machine-dependent jobs to minimize lateness on machines with identical speed under availability constraints ⋮ Scheduling periodically occurring tasks on multiple processors
This page was built for publication: