Minimizing makespan for single machine batch processing with non-identical job sizes using simulated annealing

被引：151

作者：

Melouk, S ^{[1
]}

Damodaran, P

Chang, PY

机构：

[1] Texas A&M Univ, Dept Ind Engn, College Stn, TX 77843 USA

[2] SUNY Binghamton, Dept Syst Sci & Ind Engn, Binghamton, NY 13902 USA

[3] Mingchi Inst Technol, Dept Ind Engn & Management, Taipei 243, Taiwan

来源：

INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS | 2004年 / 87卷 / 02期

关键词：

simulated annealing; batch processing; scheduling;

D O I：

10.1016/S0925-5273(03)00092-6

中图分类号：

T [工业技术];

学科分类号：

08 ;

摘要：

This research proposes a simulated annealing (SA) approach to minimize makespan for a single batch-processing machine. Each job has a corresponding processing time and size. The machine can process the jobs in batches as long as the machine capacity is not exceeded. The processing time of a batch is equal to the longest processing time among all jobs in the batch. Random instances were generated to test our approach with respect to solution quality and run time. The results of the SA approach were compared to CPLEX. Our approach outperforms CPLEX on all the instances. (C) 2003 Elsevier B.V. All rights reserved.

引用

页码：141 / 147

页数：7