Scribd
Upload
18 views2 pages

Pdf&rendition 1 2

Paper presented 2

Uploaded by

amitkumar7309580
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
18 views2 pages

Pdf&rendition 1 2

Paper presented 2

Uploaded by

amitkumar7309580
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

UNIT – 5 Job Sequencing

Introduction
Job sequencing is a problem in optimization techniques that involves
scheduling a set of jobs or tasks to be completed in the most efficient way
possible. The goal is to minimize the time it takes to complete all the jobs
while ensuring that each job is completed in the correct order and within its
given time constraints.

There are different methods for approaching job sequencing, such as priority
rules, heuristics, and mathematical programming. Priority rules involve
prioritizing jobs based on certain criteria, such as their due date or processing
time. Heuristics involve using a set of rules or algorithms to determine the
best sequencing of jobs. Mathematical programming involves using
mathematical models and algorithms to optimize the sequencing of jobs.

Job sequencing is used in a variety of industries, including manufacturing,


transportation, and healthcare. It can help increase efficiency, reduce costs,
and improve overall productivity. By understanding the principles of job
sequencing, students can develop skills in problem-solving, critical thinking,
and decision-making that can be applied in various fields.
Solution of sequencing problem Johnson s algorithm for n jobs through 2
machines
Job sequencing is a problem that arises in many industries where multiple
jobs need to be completed using a limited set of resources. Johnson's
algorithm is a solution to the sequencing problem for n jobs through 2
machines that is used in optimization techniques.
In Johnson's algorithm, the jobs are first processed through two machines in a
certain order to minimize the total processing time. The algorithm works by
first identifying the processing time of each job on both machines. Then, the
jobs are ordered based on their processing time in ascending order for the
first machine and in descending order for the second machine.

Once the jobs are ordered, they can be processed through the machines in
the order determined by the algorithm. This ensures that the total processing
time is minimized, as the jobs with the shortest processing time on the first
machine are completed first, followed by the jobs with the shortest
processing time on the second machine.

Overall, Johnson's algorithm is a powerful tool for optimizing job sequencing


through two machines. By following this algorithm, businesses can minimize
their processing time and improve their efficiency in completing tasks.

You might also like