A Hybrid Ant Colony Optimization to Minimize the Total Completion Time on a Single Batch Processing Machine with Non-identical Job Sizes

被引：0
|
作者：
Xu, Rui [1 ]
Chen, Hua-Ping [1 ]
Zhu, Jun-Hong [2 ]
Shao, Hao [1 ]
机构：
[1] Univ Sci & Technol China, Dept Informat Management & Decis Sci, Hefei 230026, Anhui, Peoples R China
[2] Hefei Univ Technol, Sch Management, Hefei 230009, Peoples R China
来源：
ICNC 2008: FOURTH INTERNATIONAL CONFERENCE ON NATURAL COMPUTATION, VOL 7, PROCEEDINGS | 2008年
基金：
中国国家自然科学基金;
关键词：
D O I：
10.1109/ICNC.2008.384
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
This paper aims at minimizing the total completion time for a single batch processing machine with non-identical job sizes. For this problem, each job has a corresponding processing time and size. The machine can process the jobs in batches as long as the total size of all the jobs in a batch does not exceed the machine capacity. The processing time of a batch is equal to the longest processing time among all the jobs in that batch. This problem is NP-hard and hence a Chaotic Ant Colony Optimization algorithm based on Batch sequence (BCACO) is proposed. Random instances were used to test the effectiveness of the proposed approach. Computational results show that BCACO significantly outperforms other algorithms addressed in the literature.
引用
收藏
页码：439 / +
页数：2
相关论文
共 50 条
  • [1] Minimizing the total completion time on a single batch processing machine with non-identical job sizes using ant colony optimization
    Xu, Rui
    Chen, Hua-Ping
    Huang, George Q.
    Shao, Hao
    Cheng, Ba-Yi
    Liu, Bo-Wen
    [J]. ICIEA 2008: 3RD IEEE CONFERENCE ON INDUSTRIAL ELECTRONICS AND APPLICATIONS, PROCEEDINGS, VOLS 1-3, 2008, : 2211 - 2215
  • [2] A Chaotic Ant Colony Optimization Method for Scheduling a Single Batch-processing Machine with Non-identical Job Sizes
    Cheng, Ba-Yi
    Chen, Hua-Ping
    Shao, Hao
    Xu, Rui
    Huang, George Q.
    [J]. 2008 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-8, 2008, : 40 - 43
  • [3] A heuristic for a batch processing machine scheduled to minimise total completion time with non-identical job sizes
    Pei-Chann Chang
    Hui-Mei Wang
    [J]. The International Journal of Advanced Manufacturing Technology, 2004, 24 : 615 - 620
  • [4] A heuristic for a batch processing machine scheduled to minimise total completion time with non-identical job sizes
    Chang, PC
    Wang, HM
    [J]. INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2004, 24 (7-8): : 615 - 620
  • [5] Constrained binary artificial bee colony to minimize the makespan for single machine batch processing with non-identical job sizes
    Al-Salamah, Muhammad
    [J]. APPLIED SOFT COMPUTING, 2015, 29 : 379 - 385
  • [6] Scheduling a single batch-processing machine with non-identical job sizes in fuzzy environment using an improved ant colony optimization
    Cheng, Bayi
    Li, Kai
    Chen, Bo
    [J]. JOURNAL OF MANUFACTURING SYSTEMS, 2010, 29 (01) : 29 - 34
  • [7] A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes
    Parsa, N. Rafiee
    Karimi, B.
    Kashan, A. Husseinzadeh
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2010, 37 (10) : 1720 - 1730
  • [8] Minimizing makespan and total completion time for parallel batch processing machines with non-identical job sizes
    Cheng, Bayi
    Yang, Shanlin
    Hu, Xiaoxuan
    Chen, Bo
    [J]. APPLIED MATHEMATICAL MODELLING, 2012, 36 (07) : 3155 - 3161
  • [9] Ant colony optimization algorithm for total weighted completion time minimization on non-identical batch machines
    Zhang, Han
    Jia, Zhao-hong
    Li, Kai
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2020, 117
  • [10] Scheduling a batch processing machine with non-identical job sizes
    Azizoglu, M
    Webster, S
    [J]. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2000, 38 (10) : 2173 - 2184
12345