Publication:3962462
From MaRDI portal
zbMath0497.68016MaRDI QIDQ3962462
Publication date: 1982
deterministic scheduling; preemptive schedules; uniform processors; maximum lateness criterion; polymatroidal network flow
90B35: Deterministic scheduling theory in operations research
90B10: Deterministic network models in operations research
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
Related Items
Scheduling machine-dependent jobs to minimize lateness on machines with identical speed under availability constraints, Scheduling periodically occurring tasks on multiple processors, Parallel machine scheduling with machine availability and eligibility constraints