In DBMS, a schedule is an arrangement of transaction operations that maintains the order of the operation in each individual transaction). Scheduling is the process of queuing up transactions and executing them one by one. When there are multiple transactions running concurrently, scheduling is used to set the order of operation so that the operations do not overlap each other. There are two types of schedules in DBMS:

• Serial Schedule: In this type of schedule, one transaction is executed completely before starting another transaction. When the first transaction completes its cycle, then the next transaction is executed.

• Non-Serial Schedule: In this type of schedule, the operations of multiple transactions are interleaved, which might lead to a rise in the concurrency problem. Non-serial schedules can be further divided into two types: Serializable and Non-Serializable.

Serializable schedules are those that maintain consistency in the database and leave it in a consistent state. Non-serializable schedules can be further divided into two types: recoverable and non-recoverable.