2019
DOI: 10.1080/00207543.2019.1683255
|View full text |Cite
|
Sign up to set email alerts
|

Modelling and solving mixed-model two-sided assembly line balancing problem with sequence-dependent setup time

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0
1

Year Published

2020
2020
2024
2024

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 30 publications
(4 citation statements)
references
References 48 publications
0
3
0
1
Order By: Relevance
“…The significance of scheduling models that account for setup times has been explored in multiple studies [57][58][59][60]. Separating setup times from processing times enables simultaneous operations, thereby enhancing resource utilization [56]. This approach is in line with the principles of modern production management systems, including JIT, Optimized Production Technology (OPT), and Group Technology (GT), supporting the need for explicit consideration of setup times in scheduling models [61].…”
Section: Kouvelis and Karabatimentioning
confidence: 92%
See 1 more Smart Citation
“…The significance of scheduling models that account for setup times has been explored in multiple studies [57][58][59][60]. Separating setup times from processing times enables simultaneous operations, thereby enhancing resource utilization [56]. This approach is in line with the principles of modern production management systems, including JIT, Optimized Production Technology (OPT), and Group Technology (GT), supporting the need for explicit consideration of setup times in scheduling models [61].…”
Section: Kouvelis and Karabatimentioning
confidence: 92%
“…However, it is often assumed that the setup times required for changing the assembly line from one product model to another are minimal and do not impact overall operations [55]. This assumption is challenged by recent discussions highlighting the critical impact of setup times on scheduling quality, especially when assembly stations operate near total capacity [56]. The significance of scheduling models that account for setup times has been explored in multiple studies [57][58][59][60].…”
Section: Kouvelis and Karabatimentioning
confidence: 99%
“…Özcan [27] paralel montaj hatlarındaki hazırlık süreleri ile ilgilenmiş, çözüm için ikili doğrusal matematiksel model önermiş ve tavlama benzetimi algoritması geliştirmiştir. Yang ve Cheng [28] hazırlık süreli karışık modelli çift taraflı MHDP için karışık tam sayılı bir matematiksel model sunmuş, çözüm için değişken komşuluk algoritması (variable neighbourhood search) önermiştir.…”
Section: Literatür Taraması (Literature Review)unclassified
“…In the case of sequence-dependent setup times occurrence [2], binary linear mathematical programming (BLP) model and a simulated annealing (SA) algorithm are proposed to model and solve balancing and scheduling tasks. In reference [24], a mixed-integer programming (MIP) mathematical model is used to formulate mixed-model two-sided assembly lines problem. An effective variable neighborhood search (VNS) algorithm is proposed to solve the balancing problem, especially for the large-sized problems.…”
mentioning
confidence: 99%