Minimizing the total completion time on a single batch processing machine with non-identical job sizes using ant colony optimization

被引:0
|
作者
Xu, Rui [1 ]
Chen, Hua-Ping [1 ]
Huang, George Q. [1 ]
Shao, Hao [1 ]
Cheng, Ba-Yi [1 ]
Liu, Bo-Wen [1 ]
机构
[1] Univ Sci & Technol China, Dept Informat Management & Decis Sci, Hefei 230026, Anhui, Peoples R China
关键词
D O I
10.1109/ICIEA.2008.4582910
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper aims at minimizing the total completion time for a single batch processing machine (BPM) 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 an ant colony optimization (ACO) approach based on job sequence is proposed. Random instances were used to test the effectiveness of the proposed approach. Computational results show that ACO significantly outperforms other algorithms addressed in the literature.
引用
收藏
页码:2211 / 2215
页数:5
相关论文
共 50 条
  • [1] A Hybrid Ant Colony Optimization to Minimize the Total Completion Time on a Single Batch Processing Machine with Non-identical Job Sizes
    Xu, Rui
    Chen, Hua-Ping
    Zhu, Jun-Hong
    Shao, Hao
    [J]. ICNC 2008: FOURTH INTERNATIONAL CONFERENCE ON NATURAL COMPUTATION, VOL 7, PROCEEDINGS, 2008, : 439 - +
  • [2] 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
  • [3] 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
  • [4] 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
  • [5] 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
  • [6] 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
  • [7] Minimizing makespan for single machine batch processing with non-identical job sizes using simulated annealing
    Melouk, S
    Damodaran, P
    Chang, PY
    [J]. INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2004, 87 (02) : 141 - 147
  • [8] Minimizing total completion time on non-identical parallel batch machines with arbitrary release times using ant colony optimization
    Zhang, Han
    Li, Kai
    Jia, Zhao -hong
    Chu, Chengbin
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2023, 309 (03) : 1024 - 1046
  • [9] Minimizing Makespan for a Single Batch Processing Machine with Non-identical Job Sizes Using Neural Nets Approach
    Shao, Hao
    Chen, Hua-Ping
    Xu, Rui
    Zhang, Wen-Gong
    [J]. ICNC 2008: FOURTH INTERNATIONAL CONFERENCE ON NATURAL COMPUTATION, VOL 6, PROCEEDINGS, 2008, : 511 - 514
  • [10] Minimizing makespan on a single batch processing machine with non-identical job sizes: A hybrid genetic approach
    Kashanl, Ali Husseinzadeh
    Karimi, Behrooz
    Jolai, Fariborz
    [J]. EVOLUTIONARY COMPUTATION IN COMBINATORIAL OPTIMIZATION, PROCEEDINGS, 2006, 3906 : 135 - 146