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 条
  • [1] Minimizing makespan for single machine batch processing with non-identical job sizes using simulated annealing
    Melouk, S
    Damodaran, P
    Chang, PY
    INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2004, 87 (02) : 141 - 147
  • [2] Minimizing makespan on a single batch processing machine with non-identical job sizes: A hybrid genetic approach
    Kashanl, Ali Husseinzadeh
    Karimi, Behrooz
    Jolai, Fariborz
    EVOLUTIONARY COMPUTATION IN COMBINATORIAL OPTIMIZATION, PROCEEDINGS, 2006, 3906 : 135 - 146
  • [3] 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
    ICNC 2008: FOURTH INTERNATIONAL CONFERENCE ON NATURAL COMPUTATION, VOL 6, PROCEEDINGS, 2008, : 511 - 514
  • [4] Minimizing makespan on a single batching machine with release times and non-identical job sizes
    Li, SG
    Li, GJ
    Wang, XL
    Liu, QM
    OPERATIONS RESEARCH LETTERS, 2005, 33 (02) : 157 - 164
  • [5] Scheduling a batch processing machine with non-identical job sizes
    Azizoglu, M
    Webster, S
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2000, 38 (10) : 2173 - 2184
  • [6] Effective hybrid genetic algorithm for minimizing makespan on a single-batch-processing machine with non-identical job sizes
    Kashan, A. H.
    Karimi, B.
    Jolai, F.
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2006, 44 (12) : 2337 - 2360
  • [7] Minimizing Makespan for Single Batch Processing Machine with Non-identical Job Sizes Using a Novel Algorithm: Free Search
    Zhang, Ya-ling
    Chen, Hua-ping
    Shao, Hao
    Xu, Rui
    2009 INTERNATIONAL CONFERENCE ON INFORMATION TECHNOLOGY AND COMPUTER SCIENCE, VOL 1, PROCEEDINGS, 2009, : 179 - 183
  • [8] Fuzzy Scheduling for Single Batch-processing Machine with Non-identical Job Sizes
    Cheng, Ba-yi
    Chen, Hua-ping
    Wang, Shuan-shi
    2008 IEEE INTERNATIONAL CONFERENCE ON FUZZY SYSTEMS, VOLS 1-5, 2008, : 27 - 30
  • [9] Minimizing the makespan on a batch machine with non-identical job sizes: an exact procedure
    Dupont, L
    Dhaenens-Flipo, C
    COMPUTERS & OPERATIONS RESEARCH, 2002, 29 (07) : 807 - 819
  • [10] Minimizing makespan on a batch-processing machine with non-identical job sizes using genetic algorithms
    Damodaran, Purushothaman
    Manjeshwar, Praveen Kumar
    Srihari, Krishnaswami
    INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2006, 103 (02) : 882 - 891
12345