Developing a Branch and Bound Algorithm for Cell Formation and Group Scheduling
Scheduling models for groups of parts have become more widely used in the industrial companies because of intensification of competition among them to get optimization in the delivery orders, reduce costs and increase quality. “Production scheduling is a meaning of verify a best or close to best ach...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Unviversity of Technology- Iraq
2018-05-01
|
| Series: | Engineering and Technology Journal |
| Subjects: | |
| Online Access: | https://etj.uotechnology.edu.iq/article_175141_b69726d70682808a3e9162694beb7a64.pdf |
| _version_ | 1797326051511107584 |
|---|---|
| author | Amjad Abdulghafour Dhulfiqar Dhayef |
| author_facet | Amjad Abdulghafour Dhulfiqar Dhayef |
| author_sort | Amjad Abdulghafour |
| collection | DOAJ |
| description | Scheduling models for groups of parts have become more widely used in the industrial companies because of intensification of competition among them to get optimization in the delivery orders, reduce costs and increase quality. “Production scheduling is a meaning of verify a best or close to best achievement time plan for performing job, Production scheduling linked with the group technology applications is called Group Scheduling (GS). The objective of this research is to find optimum sequence of parts through cell formation and group scheduling. In this research, a lower bound for best possible Makespan is calculated by branch and bound algorithm and the best order of groups and parts generated. In this research, Branch and Bound algorithm was developed by the researcher to generate machine cell and part family then gathering groups to find sequence of groups as well as parts within it and calculate Makespan for problem”. The developed algorithm have been tested by case study consist of four products processed on nine machine, the results from examining and testing of the developed algorithm is three machine cell and part family (MC-1,MC-2 and MC-3) as well as optimal Makespan for MCs is(344,152,122). |
| first_indexed | 2024-03-08T06:18:02Z |
| format | Article |
| id | doaj.art-fcbbc39a60174e5abfcf08b08206469e |
| institution | Directory Open Access Journal |
| issn | 1681-6900 2412-0758 |
| language | English |
| last_indexed | 2024-03-08T06:18:02Z |
| publishDate | 2018-05-01 |
| publisher | Unviversity of Technology- Iraq |
| record_format | Article |
| series | Engineering and Technology Journal |
| spelling | doaj.art-fcbbc39a60174e5abfcf08b08206469e2024-02-04T17:16:03ZengUnviversity of Technology- IraqEngineering and Technology Journal1681-69002412-07582018-05-01365A55556310.30684/etj.36.5A.11175141Developing a Branch and Bound Algorithm for Cell Formation and Group SchedulingAmjad Abdulghafour0Dhulfiqar Dhayef1Department of Production Engineering and Metallurgy, University of Technology, Baghdad, Iraq.Department of Production Engineering and Metallurgy, University of Technology, Baghdad, Iraq.Scheduling models for groups of parts have become more widely used in the industrial companies because of intensification of competition among them to get optimization in the delivery orders, reduce costs and increase quality. “Production scheduling is a meaning of verify a best or close to best achievement time plan for performing job, Production scheduling linked with the group technology applications is called Group Scheduling (GS). The objective of this research is to find optimum sequence of parts through cell formation and group scheduling. In this research, a lower bound for best possible Makespan is calculated by branch and bound algorithm and the best order of groups and parts generated. In this research, Branch and Bound algorithm was developed by the researcher to generate machine cell and part family then gathering groups to find sequence of groups as well as parts within it and calculate Makespan for problem”. The developed algorithm have been tested by case study consist of four products processed on nine machine, the results from examining and testing of the developed algorithm is three machine cell and part family (MC-1,MC-2 and MC-3) as well as optimal Makespan for MCs is(344,152,122).https://etj.uotechnology.edu.iq/article_175141_b69726d70682808a3e9162694beb7a64.pdfgroup schedulingcell formation |
| spellingShingle | Amjad Abdulghafour Dhulfiqar Dhayef Developing a Branch and Bound Algorithm for Cell Formation and Group Scheduling Engineering and Technology Journal group scheduling cell formation |
| title | Developing a Branch and Bound Algorithm for Cell Formation and Group Scheduling |
| title_full | Developing a Branch and Bound Algorithm for Cell Formation and Group Scheduling |
| title_fullStr | Developing a Branch and Bound Algorithm for Cell Formation and Group Scheduling |
| title_full_unstemmed | Developing a Branch and Bound Algorithm for Cell Formation and Group Scheduling |
| title_short | Developing a Branch and Bound Algorithm for Cell Formation and Group Scheduling |
| title_sort | developing a branch and bound algorithm for cell formation and group scheduling |
| topic | group scheduling cell formation |
| url | https://etj.uotechnology.edu.iq/article_175141_b69726d70682808a3e9162694beb7a64.pdf |
| work_keys_str_mv | AT amjadabdulghafour developingabranchandboundalgorithmforcellformationandgroupscheduling AT dhulfiqardhayef developingabranchandboundalgorithmforcellformationandgroupscheduling |