USA: +1-585-535-1023

UK: +44-208-133-5697

AUS: +61-280-07-5697


Types of sequencing problems

The following type of sequencing problems will be discussed in this chapter :-

a)      n jobs one machine case.

b)      n jobs two machine case

c)      n jobs ‘m’ machine case

d)      Two jobs ‘m’ machines case

The solution of these problems depends on many factors such as :-

a)      The number of jobs to be scheduled.

b)    The number of machines in the machine shop.

c)     Type of manufacturing facility (slow shop or fast shop)

d)    Manner in which jobs arrive at the facility (static or dynamic)

e)     Criterion by which scheduling alternatives are to be evaluated.

As the number of jobs (n) and the number of machines (m) increases, the sequencing problems become more complex. In fact, no exact or optimal solutions exist for sequencing problems with large n and m. Simulation seems to be a better solution technique for real life scheduling problems.