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

Show simple item record
dc.contributor.authorRostamzadeh, Reza
dc.contributor.authorGholipour, Arezou
dc.contributor.authorKomari Alaei, Mohammad Reza
dc.contributor.authorZavadskas, Edmundas Kazimieras
dc.contributor.authorSaparauskas, Jonas
dc.date.accessioned2024-09-11T10:44:55Z
dc.date.available2024-09-11T10:44:55Z
dc.date.issued2024
dc.description.abstract-translatedThe 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.
dc.format17 s.
dc.format.mimetypeapplication/pdf
dc.identifier.doi10.15240/tul/001/2024-2-007
dc.identifier.issn1212-3609 (Print)
dc.identifier.issn2336-5604 (Online)
dc.identifier.urihttp://hdl.handle.net/11025/57443
dc.language.isoenen
dc.publisherTechnická univerzita v Libercics
dc.rightsCC BY-NC 4.0en
dc.rights.accessopenAccessen
dc.subjectplánování otevřeného obchodu
dc.subjectrůzné pracovní stanice
dc.subjectproblémy s jedním strojem
dc.subjectpřiřazení zdroje
dc.subjectoptimalizace mravenčí kolonie
dc.subjectalgoritmus optimalizace velryb
dc.subject.translatedopen shop scheduling
dc.subject.translateddifferent work stations
dc.subject.translatedsingle machine problems
dc.subject.translatedresource assignment
dc.subject.translatedant colony optimization
dc.subject.translatedwhale optimization algorithm
dc.titleAn attempt to resolve no-wait flow shop scheduling problems using hybrid ant colony and whale optimization algorithms
dc.typečlánekcs
dc.type.statusPeer-revieweden
dc.type.versionpublishedVersionen
local.files.count1*
local.files.size1040262*
local.has.filesyes*

Files

Original bundle
Showing 1 - 1 out of 1 results
No Thumbnail Available
Name:
EM_2_2024_07.pdf
Size:
1015.88 KB
Format:
Adobe Portable Document Format
Download
License bundle
Showing 1 - 1 out of 1 results
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Číslo 2 (2024)