Balancing of cost-oriented U-type general resource-constrained assembly line: new constraint programming models

Basit Öğe Kaydı
dc.authoridPınarbaşı, Mehmet/0000-0003-3424-2967
dc.authoridAlakaş, Hacı Mehmet/0000-0002-9874-7588
dc.contributor.authorAlakaş, Hacı Mehmet
dc.contributor.authorPınarbaşı, Mehmet
dc.date.accessioned2025-01-21T16:36:05Z
dc.date.available2025-01-21T16:36:05Z
dc.date.issued2023
dc.departmentKırıkkale Üniversitesi
dc.description.abstractIn simple assembly line balancing problems, it is assumed that the resources required to perform the tasks are available at the relevant station for task assignment. However, each task may need different resource types depending on the difficulty, complexity and technical requirements of the tasks in real life. For this reason, tasks and resources belonging to these tasks must be assigned to the relevant station while balancing the line. In this study, the resource-constrained U-shaped assembly line balancing problem (U-GRCALBP) is discussed. According to the literature research, there is no study dealing with U-GRCALBP. Two different constraint programming (CP) models that define the resource constraints as and/or constraint types with concurrent resource types have been developed. In these models, the sum of resource usage costs and station opening cost minimization is aimed. The models are explained with an illustrative example and the efficiency of the models is tested by deriving new resource constraints on five different data set each taking into account four different cycle times and the number of two and four resource types. The number of stations obtained, the total number of resources used, total station opening and resource usage costs, and CPU time are used as performance criteria The results are compared with the traditional U-type assembly line balancing problem results. The proposed CP models give superior performance on all data sets, especially in terms of total cost. The numerical results show that both CP models are effective in solving the problem. Furthermore, some managerial implications are presented to be useful for professionals, organizations, and society.
dc.identifier.doi10.1007/s00500-023-09105-9
dc.identifier.endpage18680
dc.identifier.issn1432-7643
dc.identifier.issn1433-7479
dc.identifier.issue24
dc.identifier.scopus2-s2.0-85168145189
dc.identifier.scopusqualityQ1
dc.identifier.startpage18667
dc.identifier.urihttps://doi.org/10.1007/s00500-023-09105-9
dc.identifier.urihttps://hdl.handle.net/20.500.12587/24254
dc.identifier.volume27
dc.identifier.wosWOS:001049824700006
dc.identifier.wosqualityQ2
dc.indekslendigikaynakWeb of Science
dc.indekslendigikaynakScopus
dc.language.isoen
dc.publisherSpringer
dc.relation.ispartofSoft Computing
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı
dc.rightsinfo:eu-repo/semantics/openAccess
dc.snmzKA_20241229
dc.subjectAssembly line balancing; U-type; General resource constraints; Conjunctive constraints; Constraint programming
dc.titleBalancing of cost-oriented U-type general resource-constrained assembly line: new constraint programming models
dc.typeArticle

Dosyalar

Orijinal paket
Listeleniyor 1 - 1 / 1
Küçük Resim
İsim:
Tam Metin/Full Text
Boyut:
564.16 KB
Biçim:
Adobe Portable Document Format
İndir

Koleksiyon

WOS İndeksli Yayınlar Koleksiyonu
Makale Koleksiyonu
Scopus İndeksli Yayınlar Koleksiyonu