Minimizing the Sum of Makespan and Total Weighted Tardiness in a No-Wait Flowshop

This paper presents a cloud theory-based iterated greedy (CTIG) algorithm for solving the no-wait flowshop scheduling problem (NWFSP) with the objective of minimizing the sum of makespan and total weighted tardiness. The performance of the proposed CTIG algorithm is evaluated by comparing its comput...

Full description

Saved in:
Bibliographic Details
Published in:IEEE access Vol. 6; pp. 78666 - 78677
Main Authors: Lin, Shih-Wei, Lu, Chung-Cheng, Ying, Kuo-Ching
Format: Journal Article
Language:English
Published: Piscataway IEEE 2018
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
Algorithms
cloud theory-based iterated greedy algorithm
Computing time
Flowcharts
Greedy algorithms
Heuristic methods
Indexes
Industries
Job shop scheduling
Job shops
metaheuristics
no-wait flowshop
Particle swarm optimization
Scheduling
Single machine scheduling
Urban areas
ISSN:2169-3536, 2169-3536
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper presents a cloud theory-based iterated greedy (CTIG) algorithm for solving the no-wait flowshop scheduling problem (NWFSP) with the objective of minimizing the sum of makespan and total weighted tardiness. The performance of the proposed CTIG algorithm is evaluated by comparing its computational results to those of the best-to-date meta-heuristic algorithm, particle swarm optimization (PSO), as presented in this paper. The experimental results concerning two sets of benchmark problem instances in this paper demonstrate that the CTIG algorithm obtains more (near) optimal solution in less computational time than the PSO algorithm. The computational results in this paper fill the research gap in the development of a novel algorithm to improve the solution quality in the case of the NWFSP with the objective of minimizing the sum of makespan and total weighted tardiness.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2169-3536
2169-3536
DOI:10.1109/ACCESS.2018.2885137