An attempt to resolve no-wait flow shop scheduling problems using hybrid ant colony and whale optimization algorithms

Simple item page
dc.contributor.authorRostamzadeh, Reza
dc.contributor.authorGholipour, Arezou
dc.contributor.authorKomari Alaei, Mohammad Reza
dc.contributor.authorZavadskas, Edmundas Kazimieras
dc.contributor.authorSaparauskas, Jonas
dc.contributor.otherEkonomická fakultacs
dc.date.accessioned2024-06-05T08:49:25Z
dc.date.available2024-06-05T08:49:25Z
dc.description.abstractThe incentive for many developments and scientific progresses within the field of scheduling has emerged from industrial environments, and naturally, it could be utilized in expressing the scheduling concepts regarding terms used in the industry. Generally speaking, scheduling problems are known as limited optimization issues through which decisions related to the machines’ assignment and works processing sequence are probed. Thus, following a review of the related literature, the major goal of this research is to design a mathematical model and to solve it through a meta-heuristic for no-wait flow shop scheduling problem using different machines for the purpose of minimizing the time required to complete the work using whale and ant colony optimization (ACO) algorithms in Sanat-Gostar-e-Hamgam Shoe Company. The ACO and whale algorithm methods are used to compare and predict scheduling activities in manufacturing line of shoe industry. The results showed an ACO algorithm with two stages in mean ideal distance (MID) end amounting to 76.65 and 77.38, respectively. Also, regarding the amounts of standard error mean squares, it could be claimed that the model designed using the improved whale algorithm has a better prediction, and the minimum time required to complete works using the whale algorithm is estimated to be equal to 86.1071. This could lead to an optimal state in achieving the predetermined goals.en
dc.formattext
dc.identifier.doi10.15240/tul/001/2024-2-007
dc.identifier.eissn2336-5604
dc.identifier.issn1212-3609
dc.identifier.urihttps://dspace.tul.cz/handle/15240/175207
dc.language.isoen
dc.publisherTechnická Univerzita v Libercics
dc.publisherTechnical university of Liberec, Czech Republicen
dc.publisher.abbreviationTUL
dc.relation.ispartofEkonomie a Managementcs
dc.relation.ispartofEconomics and Managementen
dc.relation.isrefereedtrue
dc.rightsCC BY-NC
dc.subjectOpen shop schedulingen
dc.subjectdifferent work stationsen
dc.subjectsingle machine problemsen
dc.subjectresource assignmenten
dc.subjectant colony optimization (ACO)en
dc.subjectwhale optimization algorithm (WOA)en
dc.subject.classificationC6
dc.subject.classificationC61
dc.subject.classificationC63
dc.subject.classificationM11
dc.titleAn attempt to resolve no-wait flow shop scheduling problems using hybrid ant colony and whale optimization algorithmsen
dc.typeArticleen
local.accessopen
local.citation.epage124
local.citation.spage108
local.facultyFaculty of Economics
local.filenameEM_2_2024_7
local.fulltextyes
local.relation.abbreviationE+Mcs
local.relation.abbreviationE&Men
local.relation.issue2
local.relation.volume27
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
EM_2_2024_07.pdf
Size:
1015.88 KB
Format:
Adobe Portable Document Format
Description:
článek
Download
Collections
Číslo 2