Minimizing mean flow times criteria on a single batch processing machine with non-identical jobs sizes

被引：7
|
作者：
Ghazvini, FJ [1 ]
Dupont, L [1 ]
机构：
[1] Inst Natl Polytech Grenoble, Ecole Natl Super Genie Ind, Lab GILCO 46, F-38031 Grenoble, France
来源：
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS | 1998年 / 55卷 / 03期
关键词：
scheduling; batch processing machine; mean flow time; heuristic;
D O I：
暂无
中图分类号：
T [工业技术];
学科分类号：
08 ;
摘要：
This paper considers the problem of scheduling jobs with non-identical capacity requirements or sizes on a single-batch processing machine (BPM) to minimize the mean-flow times of jobs. A batch processing machine is one which can process up to B jobs simultaneously. The processing time of a batch is equal to the longest processing time among all jobs in the batch. We provide various new heuristics for this problem. Computational experiments shaw that the heuristics are capable of obtaining near-optimal solutions in very reasonable CPU times. (C) 1998 Elsevier Science B.V. All rights reserved.
引用
收藏
页码：273 / 280
页数：8
相关论文
共 50 条
  • [21] Minimizing total weighted tardiness in single machine problem with non-identical job sizes
    Bijari, Mehdi
    Rajabi, Omid
    2015 INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND OPERATIONS MANAGEMENT (IEOM), 2015,
  • [22] Minimizing makespan and total completion time for parallel batch processing machines with non-identical job sizes
    Cheng, Bayi
    Yang, Shanlin
    Hu, Xiaoxuan
    Chen, Bo
    APPLIED MATHEMATICAL MODELLING, 2012, 36 (07) : 3155 - 3161
  • [23] Parallel-batching scheduling of deteriorating jobs with non-identical sizes and rejection on a single machine
    Min Kong
    Xinbao Liu
    Jun Pei
    Zhiping Zhou
    Panos M. Pardalos
    Optimization Letters, 2020, 14 : 857 - 871
  • [24] Parallel-batching scheduling of deteriorating jobs with non-identical sizes and rejection on a single machine
    Kong, Min
    Liu, Xinbao
    Pei, Jun
    Zhou, Zhiping
    Pardalos, Panos M.
    OPTIMIZATION LETTERS, 2020, 14 (04) : 857 - 871
  • [25] Earliness-tardiness minimization on scheduling a batch processing machine with non-identical job sizes
    Li, Zhongya
    Chen, Huaping
    Xu, Rui
    Li, Xueping
    COMPUTERS & INDUSTRIAL ENGINEERING, 2015, 87 : 590 - 599
  • [26] An Improved Discrete Particle Swarm Optimization Algorithm For a Single Batch-processing Machine with Non-identical Job Sizes
    Lu, Di
    Chen, Hua-Ping
    Zhang, Wen-Gong
    Xu, Rui
    SNPD 2009: 10TH ACIS INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING, ARTIFICIAL INTELLIGENCES, NETWORKING AND PARALLEL DISTRIBUTED COMPUTING, PROCEEDINGS, 2009, : 87 - 92
  • [27] Constrained binary artificial bee colony to minimize the makespan for single machine batch processing with non-identical job sizes
    Al-Salamah, Muhammad
    APPLIED SOFT COMPUTING, 2015, 29 : 379 - 385
  • [28] 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.
    2008 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-8, 2008, : 40 - 43
  • [29] An effective hybrid multi-objective genetic algorithm for bi-criteria scheduling on a single batch processing machine with non-identical job sizes
    Kashan, Ali Husseinzadeh
    Karimi, Behrooz
    Jolai, Fariborz
    ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2010, 23 (06) : 911 - 922
  • [30] Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times
    Arroyo, Jose Elias C.
    Leung, Joseph Y. -T.
    COMPUTERS & OPERATIONS RESEARCH, 2017, 78 : 117 - 128
12345