What is Sequence Problem?

  • If the sequence (order) of m machines to perform n jobs and the actual or expected time required by each job on each of the machines is given, then general sequencing problem is to find the sequence out of (n!)m possible sequences, which minimize the total elapsed time between the start of the job in the first machine and the completion of the last job on the last machine.
  • In particular, if n = 3 and m = 3, then the total number of possible sequences will be (3!)3 = 216.

  • To find the optimum sequence would require a lot of computational time, and hence we need to adopt the sequencing technique.

Processing Time: it is the time required by job to process on each machine. And it is denoted by t.

Total Elapsed Time: it is the time interval between starting a first job of optimal sequence on the first machine and the completing the last job on the last machine. And it is denoted by T.

Idle Time: it is the time for which a machine has no job to process and it is denoted by I.

There are four types of Sequencing Problem.
  • Processing of n jobs on 2 machines
  • Processing of n jobs on 3 machines
  • Processing of n jobs on m machines
  • Processing of 2 jobs on m machines
Sequence Problem: Total Elapsed Time, Idle Time, Processing Time


Download Link for More Detail:  Sequence Problem


Or follow below link for my blog

https://cdprajapati.blogspot.com/p/blog-page.html