The maximization of CP utilization in an exponential CP-terminal system with different think times and different job sizes
optimaljob schedulingcomputer networkcentral processorclosed exponential queuing networkCP- utilizationterminals
Deterministic network models in operations research (90B10) Queues and service in operations research (90B22) Deterministic scheduling theory in operations research (90B35) Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20) Theory of operating systems (68N25)
- scientific article; zbMATH DE number 3980472
- Optimization problems on the performance of a nonreliable terminal system
- Reliability investigations of heterogeneous terminal systems using MOSEL
- Optimal Scheduling of Jobs with Exponential Service Times on Identical Parallel Processors
- scientific article; zbMATH DE number 3943020
- The effects of service disciplines on the performance of a nonreliable terminal system
- Optimization problems on the performance of a nonreliable terminal system
- The maximization of CP utilization in an exponential CP-terminal system with different think times and different job sizes
- scientific article; zbMATH DE number 3980472 (Why is no real title available?)
- Serving process with least thinking time maximizes resource utilization
This page was built for publication: The maximization of CP utilization in an exponential CP-terminal system with different think times and different job sizes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q761939)