A multi-objective linear programming model for scheduling part families and designing a group layout in cellular manufacturing systems

Different industries compete to attract customers in different ways. In the field of production, group technology (GT) is defined by identifying and grouping similar parts based on their similarities in design and production. Cellular manufacturing (CM) is an application of GT to reconfigure the fac...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Computers & operations research Ročník 151; s. 106090
Hlavní autoři: Motahari, Rasool, Alavifar, Zeinolabedin, Zareh Andaryan, Abdullah, Chipulu, Maxwell, Saberi, Morteza
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier Ltd 01.03.2023
Témata:
Cell formation
Cellular manufacturing system
Group layout
Group scheduling
Group technology
Multi-objective linear programming
Cell formation
Cellular manufacturing system
Group technology
Group layout
Group scheduling
Multi-objective linear programming
ISSN:0305-0548, 1873-765X
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Different industries compete to attract customers in different ways. In the field of production, group technology (GT) is defined by identifying and grouping similar parts based on their similarities in design and production. Cellular manufacturing (CM) is an application of GT to reconfigure the factory and job shop design. A manufacturing cell is a group of independent machines with different functions put together to produce a family of parts. Designing a cellular manufacturing system involves three major decisions: cell formation (CF), group layout (GL), and group scheduling (GS). Although these decisions are interrelated and can affect each other, they have been considered separately or sequentially in previous research. In this paper, CF, GL, and GS decisions are considered simultaneously. Accordingly, a multi-objective linear programming (MOLP) model is proposed to optimize weighted completion time, transportation cost, and machine idle time for a multi-product system. Finally, the model will be solved using the ϵ-constraint method, representing different scales solutions for decision-making. The proposed model is NP-hard. Therefore, a nondominated sorting genetic algorithm II (NSGA-II) is presented to solve it since GAMS software is unable to find optimal solutions for large-scale problems. Besides, to evaluate the performance of NSGA-II, the problem is solved by three metaheuristic algorithms. •Deciding the cell formation, group scheduling, and group layout for designing a cellular manufacturing system.•The model optimizes the completion time, machine efficiency, and transportation costs.•Considering a multi-machine system.•Solving the model by ϵ- constraint and NSGA-II algorithm.•Comparing the efficiency of NSGA-II with three other metaheuristic algorithms.
ISSN:0305-0548
1873-765X
DOI:10.1016/j.cor.2022.106090