Lab Name: Open Ended Lab to apply Particle Swarm Optimization algorithm in Python for jobs sequencing Problem
Course title: Optimization Techniques Total Marks: ____________
Practical No. 14 Date of experiment performed: ____________
Course teacher/Lab Instructor: Dr. Saif Ullah Date of marking: ____________
Student Name: _________________________
Registration no.__________________________
Marking Evaluation Sheet
Knowledge components Domain Contribution Max. Obtained
Taxonomy level
marks marks
1. Student has successfully imitated the Imitation (P1) 2
Genetic Algorithm steps
2. Student has applied PSO algorithm to
Manipulate (P2) 2
create particles (Manipulation)
3. Student has successfully applied PSO Psychomotor 75%
Manipulate (P2) 2
on job sequencing Problem.
(Manipulation)
4. Student has successfully applied PSO
on jobs sequencing Problem with at Manipulate (P2) 2
least 10 jobs which is marked as Task.
(Manipulation)
5. Student was aware of safety time of
the tasks given during lab duration and Affective Receiving (A1) 1
completed given tasks in time.
6. Student contributed and responded
effectively in the form of team or in a Affective Respond (A2) 5% 1
group.
7. Student submitted the lab reports in
the deadline. Affective Valuing (A3) 1
8. Student has learned and applied sets,
Cognitive Analyze (C4) 20% 4
tuples, functions, ifelse and nested
ifelse commands of Python.
Total 15
Normalize
marks out of 5
(5)
Signed by Course teacher/ Lab Instructor
Lab 14
OBJECTIVE:
Open Ended Lab to apply Particle Swarm Optimization algorithm in Python for jobs sequencing
Problem
APPARATUS USED:
Personal Computer, Internet facility, Python
THEORY:
A permutation flow shop consist of 5 machines and there are 5 orders received by the company
to produce in this shop. The processing time of each order on each machine and due date of the
orders is given in Table 1. Evaluate the possible order sequences of orders and optimize the
schedule of orders with an objective to minimize the total lateness of orders using Genetic
Algorithm.
Table 1: Processing time of orders on Machines in Permutation Flowshop
Order 1 2 3 4 5
Machine 1 12 16 10 13 7
Machine 2 5 2 9 9 12
Machine 3 9 6 7 8 6
Machine 4 4 6 3 2 8
Machine 5 4 5 2 3 7
Due Dates 38 42 37 42 60
Procedure
Results:
Discussion:
Conclusion:
