Next Article in Journal
Agent-Based Virtual Machine Migration for Load Balancing and Co-Resident Attack in Cloud Computing
Previous Article in Journal
PrivacyGLUE: A Benchmark Dataset for General Language Understanding in Privacy Policies
 
 
Article
Peer-Review Record

Optimizing a U-Shaped Conveyor Assembly Line Balancing Problem Considering Walking Times between Assembly Tasks

Appl. Sci. 2023, 13(6), 3702; https://doi.org/10.3390/app13063702
by Yiyo Kuo 1,*, Ssu-Han Chen 1, Taho Yang 2 and Wei-Chen Hsu 1
Reviewer 1: Anonymous
Reviewer 2: Anonymous
Appl. Sci. 2023, 13(6), 3702; https://doi.org/10.3390/app13063702
Submission received: 22 February 2023 / Revised: 6 March 2023 / Accepted: 9 March 2023 / Published: 14 March 2023

Round 1

Reviewer 1 Report

In this study, a mathematical model is proposed for the U-type assembly line, which takes into account walking speeds. It is aimed to minimize the cycle time according to the number of fixed stations. Walking time was also taken into account in the cycle time.

The following corrections should be made in the study:

The mathematical model should be given before the explanations. It should be given immediately after the parameters.

Solved problems for testing algorithms are insufficient. Tests were carried out according to the number of 2, 3 and 4 stations for the experimental sets whose number of tasks varied between 7 and 10. The tests should be done by taking into account the experimental sets with a large number of tasks and the higher number of stations.

It is not clear what the values in the tables given for the comparison of test problems represent (Tables 2, 3 and 5).

There is no need to compare with traditional straight lines.

The effectiveness of the algorithm should be demonstrated using different comparison data.

When the problem size of the mathematical model grows, the results should be analyzed and interpreted. The effectiveness of the model should be tested by running it in a time-limited manner. It can be compared with the Simulated Annealing algorithm.

Author Response

Please see the attachment.

Author Response File: Author Response.pdf

Reviewer 2 Report

1.     Literature survey in the introduction is relatively poor and the references are relatively old. The introduction has to be improved by addressing the more recent works.

2.     The novelty of this work needs to be elaborated more. Why this study is so important? How it differentiates from the other methods and published literature.

3.     This statement in the abstract is ambiguous and must be corrected “ Because LINGO 17 requires a long computing time, Simulated Annealing (SA) is proposed, which can accept worse new solutions in the search procedure”.

4.     Lines 74-80, the count of the four types of assembly line balancing problem should be consistent note 1, 2, E and F.

5.     Line 88-89: Add references for this statement: Some cases that have been studied in the literature are modified for testing.

6.     It was unnecessary to provide the article's organization at the end of the introduction section.

7.     The mathematical formulations lack essential information and references.

8.     The authors claimed that they had utilized LINGO 17 software, however they did not provide any other information about the software.

9.     Conclusions need extensive improvements.

 



Author Response

Please see the attachment.

Author Response File: Author Response.pdf

Round 2

Reviewer 1 Report

The authors made the revisions that indicated. This article may be accepted for publication in the journal.

Reviewer 2 Report

The authors have satisfactorily addressed most of my concerns.

Back to TopTop