Multi-objective ACO algorithms to minimise the makespan and the total rejection cost on BPMs with arbitrary job weights-Reference-Cited by-同舟云学术

Multi-objective ACO algorithms to minimise the makespan and the total rejection cost on BPMs with arbitrary job weights

Published:2017-10-16 Issue:16 Volume:48 Page:3542-3557
ISSN:0020-7721
Container-title:International Journal of Systems Science
language:en
Short-container-title:International Journal of Systems Science

Author:

Jia Zhao-hong¹²,Pei Ming-li²,Leung Joseph Y.-T.³⁴

Affiliation:

1. Key Lab of Intelligent Computing and Signal Processing of Ministry of Education, Anhui University, Hefei, Anhui, P.R. China

2. School of Computer Science and Technology, Anhui University, Hefei, Anhui, P.R. China

3. School of Management, Hefei University of Technology, Hefei, Anhui, P.R. China

4. Department of Computer Science, New Jersey Institute of Technology, Newark, NJ, USA

Funder

National Natural Science Foundation

Humanity and Social Science Youth Foundation of Ministry of Education of China

Natural Science Foundation of Anhui Province

Natural Science Foundation of Anhui Provincial Education Department

Publisher

Informa UK Limited

Subject

Computer Science Applications,Theoretical Computer Science,Control and Systems Engineering

Link

https://www.tandfonline.com/doi/pdf/10.1080/00207721.2017.1387314

Reference31 articles.

1. Solving multi-objective parallel machine scheduling problem by a modified NSGA-II

2. Multiprocessor Scheduling with Rejection

3. Scheduling a batching machine

4. Online scheduling on batching machines to minimise the total weighted completion time of jobs with precedence constraints and identical processing times

5. Minimizing makespan on parallel batch processing machines

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Effective league championship algorithm and lower bound procedure for scheduling a single batch-processing machine with non-identical job sizes and job rejection;RAIRO - Operations Research;2023-05

2. A New Multiobjective Time-Cost Trade-Off for Scheduling Maintenance Problem in a Series-Parallel System;Mathematical Problems in Engineering;2021-06-30

3. An Improved ACO with First-job Restriction and P-ANT for Batch Scheduling Problem;2019 IEEE SmartWorld, Ubiquitous Intelligence & Computing, Advanced & Trusted Computing, Scalable Computing & Communications, Cloud & Big Data Computing, Internet of People and Smart City Innovation (SmartWorld/SCALCOM/UIC/ATC/CBDCom/IOP/SCI);2019-08

4. A bi-criteria optimization model for medical device sterilization;Annals of Operations Research;2019-06-20

5. Toward an Efficient Resolution for a Single-machine Bi-objective Scheduling Problem with Rejection;Foundations of Computing and Decision Sciences;2019-06-01