Solving Biobjective Distributed Flow-Shop Scheduling Problems With Lot-Streaming Using an Improved Jaya Algorithm

A distributed flow-shop scheduling problem with lot-streaming that considers completion time and total energy consumption is addressed. It requires to optimally assign jobs to multiple distributed factories and, at the same time, sequence them. A biobjective mathematic model is first developed to de...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on cybernetics 2023-06, Vol.53 (6), p.3818-3828
Main Authors: Pan, Yuxia, Gao, Kaizhou, Li, Zhiwu, Wu, Naiqi
Format: Article
Language:English
Subjects:
Algorithms
Business competition
Collaboration
Completion time
Energy consumption
Flow-shop scheduling
Indexes
Industrial plants
Jaya algorithm
Job shop scheduling
lot-streaming
makespan
Mathematical models
Memetics
Production facilities
total energy consumption
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A distributed flow-shop scheduling problem with lot-streaming that considers completion time and total energy consumption is addressed. It requires to optimally assign jobs to multiple distributed factories and, at the same time, sequence them. A biobjective mathematic model is first developed to describe the considered problem. Then, an improved Jaya algorithm is proposed to solve it. The Nawaz-Enscore-Ham (NEH) initializing rule, a job-factory assignment strategy, the improved strategies for makespan and energy efficiency are designed based on the problem's characteristic to improve the Jaya's performance. Finally, experiments are carried out on 120 instances of 12 scales. The performance of the improved strategies is verified. Comparisons and discussions show that the Jaya algorithm improved by the designed strategies is highly competitive for solving the considered problem with makespan and total energy consumption criteria.
ISSN:2168-2267
2168-2275
DOI:10.1109/TCYB.2022.3164165