Distributed No-Wait Flow Shop With Fuzzy Environment
No Thumbnail Available
Date
2022
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Springer Science and Business Media Deutschland GmbH
Open Access Color
Green Open Access
No
OpenAIRE Downloads
OpenAIRE Views
Publicly Funded
No
Abstract
In the no-wait flow shop scheduling problem, n-job should be proceeded on m-machine with the same order and do not permit the jobs to wait during the scheduling periods. Also, at the distributed no-wait flow shop scheduling problem, there are multi-factory for processing n-job with m-machine for no-wait constraint. In this study, distributed no-wit flow shop scheduling with the fuzzy due date is considered. The due date of the jobs is defined with fuzzy numbers. A parallel kangaroo algorithm is proposed to solve the distributed no-wait flow shop scheduling problem with the fuzzy due date. The proposed algorithm is tested from the literature by the benchmark problems. The results show that the proposed parallel kangaroo algorithm is efficient for distributed no-wit flow shop scheduling problems with fuzzy due date problems. © 2022, The Author(s), under exclusive license to Springer Nature Switzerland AG.
Description
International Conference on Intelligent and Fuzzy Systems, INFUS 2022 -- 19 July 2022 through 21 July 2022 -- 280209
Keywords
Distributed no-wait flow shop, Fuzzy due date, Parallel kangaroo algorithm, Scheduling, Fuzzy Due Date, Parallel Kangaroo Algorithm, Scheduling, Distributed No-Wait Flow Shop
Turkish CoHE Thesis Center URL
Fields of Science
0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology
Citation
WoS Q
N/A
Scopus Q
Q4

OpenCitations Citation Count
1
Source
Lecture Notes in Networks and Systems
Volume
504 LNNS
Issue
Start Page
279
End Page
286
PlumX Metrics
Citations
CrossRef : 1
Scopus : 2
SCOPUS™ Citations
2
checked on Feb 03, 2026
Web of Science™ Citations
3
checked on Feb 03, 2026
Google Scholar™


