Homework/Assignment 2

Full Name of submitter: Nguyễn Tiên Tiến Student ID: IEIEIU19021

Your Group number is: 3

Group members are: 9

ID Full Name
IEIEIU19021 Nguyễn Tiên Tiến
IEIEIU20091 Lê Tiến Thuận
IEIEIU20037 Chung Vũ Thúy Anh
IEIEIU19043 Trần Công Bảo
IEIEIU19041 Lê Gia Bảo
IEIEIU19004 Nguyễn Đình Hải
IEIEIU19049 Đào Minh Hậu
IEIEIU19081 Lê Diệu Linh
IEIEIU19015 Nguyễn Tuấn Thành

Note:

- Continue using this form to complete your works and submit on Blackboard
- Name your file: If you submit for a group (Group # are as per the number you have registered as
guided in the file “Semester Project Requirement” and be finalized by lecturer):
2223S1FL_HW2_G#
- Please submit the work in the Excel file, present the answer in a clean and respectful manner.
Do not include the note and questions in your submitted file. Continue using this form to
complete your works and submit on Blackboard.
- Only 1 member in group submits (it is not necessary to be the leader to submit).
- Due Date is defined in detail at each “ASSIGNMENT INFORMATION” from Blackboard
- Maximum score of late submission is two third of “Point Possible”
- If you can’t submit on Blackboard: Email your work to TA, copy it to your Lecturer, attached also
the screenshot of your Blackboard showing error in that transaction

---------

FL-HW2 Page 1 / 5
 Problem(s) Machine #

1. Any ideas when applying Direct Clustering Algorithm (DCA) and also to minimize Part # 1 2 3 4 5
number of cells to be formed 1 1 1
2. For the machine-part matrix shown in table, form cells using the Direct Clustering
2 1
Algorithm (DCA) and, if conflicts exist, propose alternative approaches for
resolving the conflicts. 3 1 1 1
3. Based on data of the figure
4 1 1
a. Develop the From-to chart
b. Figure out the triangular mileage chart 5 1 1

6 1 1

7 1 1

FL-HW2 Page 2 / 5
 1. Any ideas when applying Direct Clustering Algorithm (DCA) and also to minimize
number of cells to be formed
Some application of Direct Clustering Algorithm (DCA) through articles:
Implementation of cellular manufacturing system in a pump industry using
DCA. Cellular manufacturing has become an effective tool for improving
productivity. Attainment of full benefits of cellular manufacturing depends firstly on
the design of the machine cells and part families and secondly on the method of
operation which take full advantages of cell properties.
DCA development to form component families and machine groups for cell
production by gradually restructuring machine component matrices. This method
allows interaction from users when exceptions and overlaps between groups cause
the repeating algorithm to stop prematurely. This is an effective and effective
approach that offers high flexibility in identifying optimal families and groups.
The crew pairing problem is one of the most difficult airline planning problems.
Identifying whether a sequence of flights represents a viable pairing can be
challenging in and of itself. A pairing is a series of flight legs that begin and end at
the same base and are separated by connection time and rest intervals. So, DCA are
designed to combine flights that cover limitations in order to lessen the size of the
challenge.
2. For the machine-part matrix shown in table, form cells using the Direct Clustering
Algorithm (DCA) and, if conflicts exist, propose alternative approaches for
resolving the conflicts.
Step 1: Order the rows and columns

FL-HW2 Page 3 / 5
 Step 2: Sort the column.
Step 3: Sort the rows.

Step 4: Form cells.

Parts 3, 6, and 7 are processed in a cell made up of machines 2a, 4, and 5.

Parts 1, 2, 4, and 5 are processed in a cell made up of machines 1, 2b, and 3.

FL-HW2 Page 4 / 5
 3. Based on data of the figure
a. Develop the From-to chart
b. Figure out the triangular mileage chart
The solution is in the Excel file

FL-HW2 Page 5 / 5