General resource-constrained assembly line balancing problem: conjunction normal form based constraint programming models

Basit Öğe Kaydı
dc.authoridALAKAS, Haci Mehmet/0000-0002-9874-7588
dc.contributor.authorAlakas, Haci Mehmet
dc.date.accessioned2025-01-21T16:41:17Z
dc.date.available2025-01-21T16:41:17Z
dc.date.issued2021
dc.departmentKırıkkale Üniversitesi
dc.description.abstractIn the literature, most of the researchers studying assembly line balancing have only considered task assignments. However, resources are needed to perform the tasks. Therefore, assigning resources related to tasks becomes more realistic when assigning tasks to stations. In the general case of the problem, the task is performed with a specified amount of resources. If resource types such as a, b, c are required to perform tasks in an assembly line, the combination of tasks required from these resources should also be assigned to the stations. This type of problem is defined as general resources-constrained assembly line balancing problem (GRCALBP). In this study, GRCALBP is addressed to minimize cycle time and resource usage for a given number of stations. New constraint programming (CP) models based on conjunction normal form are proposed. The CP models are tested with generated problem instances from the data set in the literature. The experimental results show that CP is an efficient and effective modeling technique to solve GRCALBP. Finally, suggestions are made regarding alternative objective functions.
dc.identifier.doi10.1007/s00500-021-05602-x
dc.identifier.endpage6111
dc.identifier.issn1432-7643
dc.identifier.issn1433-7479
dc.identifier.issue8
dc.identifier.scopus2-s2.0-85100828516
dc.identifier.scopusqualityQ1
dc.identifier.startpage6101
dc.identifier.urihttps://doi.org/10.1007/s00500-021-05602-x
dc.identifier.urihttps://hdl.handle.net/20.500.12587/24858
dc.identifier.volume25
dc.identifier.wosWOS:000617082100003
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/closedAccess
dc.snmzKA_20241229
dc.subjectAssembly line balancing; General resource constraints; Constraint programming; Type-2 problem; Conjunction normal form
dc.titleGeneral resource-constrained assembly line balancing problem: conjunction normal form based constraint programming models
dc.typeArticle

Dosyalar

Koleksiyon

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