There may be multiple ready queues to reflect jobs priorities and multiple blocked queues to represent the events for which the process is waiting. We'll talk more about the details of this next lecture, but you should think about what constitutes a process context. The answers to those questions make up the subtopic of process scheduling. The process leaves the running state exactly once, when it exits. A process never enters the blocked state.
Examples are batch systems.
Some web servers are conceptually run to completion, but because they are usually implemented on systems with a more complex scheduler, their behavior is more complex. Processes in a coopertive multitasking environment tell the OS when to switch them. An example is Apple's original multitasking system and some Java systems. UNIX is a preemptive multitasking system. The time a process can keep the CPU is called the system's time quantum.