A sequencing problem involves determining the optimal order or sequence of performing a series of jobs on a finite number of facilities, such as machines, in order to minimize the total elapsed time or cost. This problem arises in various situations, such as in a manufacturing plant for performing orders, in a hospital where patients wait for different types of tests, and in a bank where customers wait for different types of transactions. The general sequencing problem involves finding the sequence out of a large number of possible sequences that minimizes the total elapsed time between the start and completion of all jobs. Some of the basic terms used in sequencing include the number of machines, processing order, and processing time. Examples of sequencing problems in daily life include determining the optimal order of processing jobs on two machines in a factory and scheduling maintenance in a factory.