2021
DOI: 10.1007/s10479-021-04015-1
|View full text |Cite
|
Sign up to set email alerts
|

A novel variable neighborhood strategy adaptive search for SALBP-2 problem with a limit on the number of machine’s types

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
7
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
8

Relationship

2
6

Authors

Journals

citations
Cited by 9 publications
(8 citation statements)
references
References 29 publications
1
7
0
Order By: Relevance
“…The problem-solving accuracy of the VaNSAS algorithm has been proven by several researchers. Jirasirilerd et al [57] and Pitakaso et al [58,64] used the VaNSAS algorithm for production and planning problem solving. The operating algorithm used in the VaNSAS process can be the differential evolution algorithm, the iterated local search, the swap method, the modified differential evolution algorithm, the large neighborhood search, or the shortest processing time-swap.…”
Section: Literature Reviewmentioning
confidence: 99%
“…The problem-solving accuracy of the VaNSAS algorithm has been proven by several researchers. Jirasirilerd et al [57] and Pitakaso et al [58,64] used the VaNSAS algorithm for production and planning problem solving. The operating algorithm used in the VaNSAS process can be the differential evolution algorithm, the iterated local search, the swap method, the modified differential evolution algorithm, the large neighborhood search, or the shortest processing time-swap.…”
Section: Literature Reviewmentioning
confidence: 99%
“…This paper presents a novel method called variable neighborhood strategy adaptive search (VaNSAS) to solve the parallel-machine-scheduling problem in order to minimize energy consumption while considering job priority and makespan control. Although VaNSAS successfully improved solution-search performance in previous studies [17,22,[36][37][38], none had accounted for energy consumption, late delivery charge, and production overhead. The advantage of applying VaNSAS in this study was that its algorithms search for the best possible solution in many different areas by using several searching approaches, thereby moving to find more diversification and intensification at all times depending on the designed blackbox methods.…”
Section: Discussionmentioning
confidence: 96%
“…In a manufacturing case study regarding the garment industry, the VaNSAS proposed by Jirasirilerd et al [22] presented a better solution and less computation time in order to minimize cycle time for a simple assembly line, balancing the Type 2 problem while considering the number and types of machines operated in each workstation. Recently, Pitakaso et al [38] applied VaNSAS to minimize the cycle time while considering the limited number of machine types in a particular workstation for the special case of the simple assembly line balancing Type 2 problems, where multi-skilled workers have a set of competencies that allow them to work on more than one machine in a workstation. Results showed that VaNSAS was able to reduce the cycle time and increase assembly line effectiveness.…”
Section: Literature Reviewmentioning
confidence: 99%
See 1 more Smart Citation
“…For each IB, q is a predefined parameter that is set to 100 iterations [59]. The Pareto front was used to keep the nondominated solution.…”
Section: Perform the Wp Execution Processmentioning
confidence: 99%