Computerized Scheduling System Essay
Computerized Scheduling System
A computerized reservations and scheduling system is provided which alternately allows transportation consumers to select from pre-scheduled transportation services provided by transportation providers or to negotiate and contract with transportation providers who have available unscheduled transportation space. The system comprises a central computerized data base. Transportation providers and consumers alike access the computer via a plurality of terminal units. The central computerized data base comprises a “maybe” file for storing information regarding available unscheduled transportation space which may be offered by a provider for service if a suitable consumer demand exists and for storing information regarding unscheduled transportation space which is needed by consumers. The “maybe” file facilitates negotiating and contracting between the parties.
Scheduling is the process of deciding how to commit resources between a variety of possible tasks. Time can be specified (scheduling a flight to leave at 8:00) or floating as part of a sequence of events. The word may also refer to:
* I/O scheduling, the order in which I/O requests are submitted to a block device in Computer Operating Systems * Scheduling (broadcasting), the minute planning of the content of a radio or television broadcast channel * Scheduling algorithm
* Scheduling (computing), the way various processes are assigned in multitasking and multiprocessing operating system design * Scheduling (production processes), the planning of the production or the operation * Schedule (workplace), ensuring that an organization has sufficient staffing levels at all times * Job scheduler, an enterprise software application in charge of unattended background executions. * Job Shop Scheduling, an optimization problem in computer science. http://en.wikipedia.org/wiki/Scheduling
Scheduling is a key concept in computer multitasking, multiprocessing operating system and real-time operating system designs. Scheduling refers to the way processes are assigned to run on the available CPUs, since there are typically many more processes running than there are available CPUs. This assignment is carried out by softwares known as a scheduler and dispatcher. The scheduler is concerned mainly with:
* Throughput – number of processes that complete their execution per time unit. * Latency, specifically: * Turnaround – total time between submission of a process and its completion. * Response time – amount of time it takes from when a request was submitted until the first response is produced. * Fairness – Equal CPU time to each process (or more generally appropriate times according to each process’ priority).