Single machine batch processing problem with release dates to minimize total completion time

被引：13

作者：

Beldar, Pedram ^{[1
]}

Costa, Antonio ^{[2
]}

机构：

[1] Islamic Azad Univ, Qazvin Branch, Dept Ind & Mech Engn, Qazvin, Iran

[2] Univ Catania, DICAR, Viale Andrea Doria 6, I-95125 Catania, Italy

来源：

INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING COMPUTATIONS | 2018年 / 9卷 / 03期

关键词：

Minimization of total completion time; Batch processing; Single machine scheduling; Mathematical programming; Scheduling with release dates; HYBRID PARTICLE-SWARM; NONIDENTICAL JOB SIZES; MAKESPAN MINIMIZATION; TABU SEARCH; OPTIMIZATION; TARDINESS; ALGORITHM; EARLINESS; COLONY;

D O I：

10.5267/j.ijiec.2017.8.003

中图分类号：

T [工业技术];

学科分类号：

08 ;

摘要：

A single machine batch processing problem with release dates to minimize the total completion time (1 vertical bar r(j),batch vertical bar Sigma C-j ) is investigated in this research. An original mixed integer linear programming (MILP) model is proposed to optimally solve the problem. Since the research problem at hand is shown to be NP-hard, several different meta-heuristic algorithms based on tabu search (TS) and particle swarm optimization (PSO) are used to solve the problem. To find the most performing heuristic optimization technique, a set of test cases ranging in size (small, medium, and large) are randomly generated and solved by the proposed meta-heuristic algorithms. An extended comparison analysis is carried out and the outperformance of a hybrid meta-heuristic technique properly combining PSO and genetic algorithm (PSO-GA) is statistically demonstrated. (C) 2018 Growing Science Ltd. All rights reserved

引用

页码：331 / 348

页数：18

共 43 条

[1] Constrained binary artificial bee colony to minimize the makespan for single machine batch processing with non-identical job sizes [J].

Al-Salamah, Muhammad .

APPLIED SOFT COMPUTING, 2015, 29 :379-385

[2]

[Anonymous], 2013, Evolutionary Optimization Algorithms

[3]

[Anonymous], 2009, PRINCIPLES SEQUENCIN

[4] Minimization of weighted earliness and tardiness for no-wait sequence-dependent setup times flowshop scheduling problem [J].

Arabameri, Sedighe ;

Salmasi, Nasser .

COMPUTERS & INDUSTRIAL ENGINEERING, 2013, 64 (04) :902-916

[5] MINIMIZING TOTAL COMPLETION-TIME ON A BATCH PROCESSING MACHINE WITH JOB FAMILIES [J].

CHANDRU, V ;

LEE, CY ;

UZSOY, R .

OPERATIONS RESEARCH LETTERS, 1993, 13 (02) :61-65

[6] A heuristic for a batch processing machine scheduled to minimise total completion time with non-identical job sizes [J].

Chang, PC ;

Wang, HM .

INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2004, 24 (7-8) :615-620

[7] A hybrid approach based on the variable neighborhood search and particle swarm optimization for parallel machine scheduling problems-A case study for solar cell industry [J].

Chen, Yin-Yann ;

Cheng, Chen-Yang ;

Wang, Li-Chih ;

Chen, Tzu-Li .

INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2013, 141 (01) :66-78

[8]

Corder GW., 2014, NONPARAMETRIC STAT S

[9] Minimizing the total completion time on a parallel machine system with tool changes [J].

Costa, A. ;

Cappadonna, F. A. ;

Fichera, S. .

COMPUTERS & INDUSTRIAL ENGINEERING, 2016, 91 :290-301

[10] A parallel tabu search for solving the primal buffer allocation problem in serial production systems [J].

Costa, A. ;

Alfieri, A. ;

Matta, A. ;

Fichera, S. .

COMPUTERS & OPERATIONS RESEARCH, 2015, 64 :97-112

← 1 2 3 4 5 →