By contrast, online processing such as by servers has open-ended input (they service requests as long as they run), and thus never complete, only stopping when terminated (sometimes called "canceled"): a server's job is never done.
Note that these distinctions have become blurred in computing, where the oxymoronic term "batch job" is found, and used either for a one-off job or for a round of "batch processing" (same processing step applied to many items at once, originally punch cards).
This analogy is applied to computer systems, where the system resources are analogous to machines in a job shop, and the goal of scheduling is to minimize the total time from beginning to end (makespan).
The term "job" for computing work dates to the mid 1950s, as in this use from 1955: "The program for an individual job is then written, calling up these subroutines by name wherever required, thus avoiding rewriting them for individual problems".
A standard early use of "job" is for compiling a program from source code, as this is a one-off task.