Ant colony optimization algorithm for scheduling jobs with fuzzy processing time on parallel batch machines with different capacities

Zhaohong Jia, Jianhai Yan, Joseph Leung, Kai Li, Huaping Chen

Research output: Contribution to journalArticle

Abstract

We study the problem of scheduling on parallel batch processing machines with different capacities under a fuzzy environment to minimize the makespan. The jobs have non-identical sizes and fuzzy processing times. After constructing a mathematical model of the problem, we propose a fuzzy ant colony optimization (FACO) algorithm. Based on the machine capacity constraint, two candidate job lists are adopted to select the jobs for building the batches. Moreover, based on the unoccupied space of the solution, heuristic information is designed for each candidate list to guide the ants. In addition, a fuzzy local optimization algorithm is incorporated to improve the solution quality. Finally, the proposed algorithm is compared with several state-of-the-art algorithms through extensive simulated experiments and statistical tests. The comparative results indicate that the proposed algorithm can find better solutions within reasonable time than all the other compared algorithms.

LanguageEnglish (US)
Pages548-561
Number of pages14
JournalApplied Soft Computing Journal
Volume75
DOIs
StatePublished - Feb 1 2019

Fingerprint

Ant colony optimization
Scheduling
Processing
Statistical tests
Mathematical models
Experiments

Cite this

Jia, Zhaohong ; Yan, Jianhai ; Leung, Joseph ; Li, Kai ; Chen, Huaping. / Ant colony optimization algorithm for scheduling jobs with fuzzy processing time on parallel batch machines with different capacities. In: Applied Soft Computing Journal. 2019 ; Vol. 75. pp. 548-561.
@article{210ecff71e0846bc968cdc047a9bbecc,
title = "Ant colony optimization algorithm for scheduling jobs with fuzzy processing time on parallel batch machines with different capacities",
abstract = "We study the problem of scheduling on parallel batch processing machines with different capacities under a fuzzy environment to minimize the makespan. The jobs have non-identical sizes and fuzzy processing times. After constructing a mathematical model of the problem, we propose a fuzzy ant colony optimization (FACO) algorithm. Based on the machine capacity constraint, two candidate job lists are adopted to select the jobs for building the batches. Moreover, based on the unoccupied space of the solution, heuristic information is designed for each candidate list to guide the ants. In addition, a fuzzy local optimization algorithm is incorporated to improve the solution quality. Finally, the proposed algorithm is compared with several state-of-the-art algorithms through extensive simulated experiments and statistical tests. The comparative results indicate that the proposed algorithm can find better solutions within reasonable time than all the other compared algorithms.",
author = "Zhaohong Jia and Jianhai Yan and Joseph Leung and Kai Li and Huaping Chen",
year = "2019",
month = "2",
day = "1",
doi = "https://doi.org/10.1016/j.asoc.2018.11.027",
language = "English (US)",
volume = "75",
pages = "548--561",
journal = "Applied Soft Computing",
issn = "1568-4946",
publisher = "Elsevier BV",

}

Ant colony optimization algorithm for scheduling jobs with fuzzy processing time on parallel batch machines with different capacities. / Jia, Zhaohong; Yan, Jianhai; Leung, Joseph; Li, Kai; Chen, Huaping.

In: Applied Soft Computing Journal, Vol. 75, 01.02.2019, p. 548-561.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Ant colony optimization algorithm for scheduling jobs with fuzzy processing time on parallel batch machines with different capacities

AU - Jia, Zhaohong

AU - Yan, Jianhai

AU - Leung, Joseph

AU - Li, Kai

AU - Chen, Huaping

PY - 2019/2/1

Y1 - 2019/2/1

N2 - We study the problem of scheduling on parallel batch processing machines with different capacities under a fuzzy environment to minimize the makespan. The jobs have non-identical sizes and fuzzy processing times. After constructing a mathematical model of the problem, we propose a fuzzy ant colony optimization (FACO) algorithm. Based on the machine capacity constraint, two candidate job lists are adopted to select the jobs for building the batches. Moreover, based on the unoccupied space of the solution, heuristic information is designed for each candidate list to guide the ants. In addition, a fuzzy local optimization algorithm is incorporated to improve the solution quality. Finally, the proposed algorithm is compared with several state-of-the-art algorithms through extensive simulated experiments and statistical tests. The comparative results indicate that the proposed algorithm can find better solutions within reasonable time than all the other compared algorithms.

AB - We study the problem of scheduling on parallel batch processing machines with different capacities under a fuzzy environment to minimize the makespan. The jobs have non-identical sizes and fuzzy processing times. After constructing a mathematical model of the problem, we propose a fuzzy ant colony optimization (FACO) algorithm. Based on the machine capacity constraint, two candidate job lists are adopted to select the jobs for building the batches. Moreover, based on the unoccupied space of the solution, heuristic information is designed for each candidate list to guide the ants. In addition, a fuzzy local optimization algorithm is incorporated to improve the solution quality. Finally, the proposed algorithm is compared with several state-of-the-art algorithms through extensive simulated experiments and statistical tests. The comparative results indicate that the proposed algorithm can find better solutions within reasonable time than all the other compared algorithms.

UR - http://www.scopus.com/inward/record.url?scp=85057599830&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85057599830&partnerID=8YFLogxK

U2 - https://doi.org/10.1016/j.asoc.2018.11.027

DO - https://doi.org/10.1016/j.asoc.2018.11.027

M3 - Article

VL - 75

SP - 548

EP - 561

JO - Applied Soft Computing

T2 - Applied Soft Computing

JF - Applied Soft Computing

SN - 1568-4946

ER -