Title
Distance matrix based heuristics to minimize makespan of parallel batch processing machines with arbitrary job sizes and release times.
Abstract
Graphical abstractDisplay Omitted HighlightsA scheduling problem on a group of parallel batch processing machines is considered.Several distance matrix based approaches and a scheduling technique are developed.Evaluate the effectiveness of our heuristics with a set of existing algorithms. Batch scheduling is prevalent in many industries such as burn-in operations in semiconductor manufacturing and heat treatment operations in metalworking. In this paper, we consider the problem of minimizing makespan on parallel batch processing machines in the presence of non-identical job sizes and arbitrary release times. Since the problem under study is strongly NP-hard (non-deterministic polynomial-time hard), we develop a number of efficient heuristics. In the proposed heuristics, several distance matrix based approaches are first developed to form batches and a scheduling technique is devised to assign the batches to parallel machines. The performance of the proposed heuristics is evaluated by comparing their results to a set of existing heuristic and meta-heuristic algorithms in the literature. The computational experiments show that the proposed heuristics are competitive with respect to solution quality. Moreover, the computational costs of the proposed heuristics are very little.
Year
DOI
Venue
2017
10.1016/j.asoc.2016.10.008
Appl. Soft Comput.
Keywords
Field
DocType
Scheduling,Batch processing machines,Makespan,Heuristics,Distance matrix
Mathematical optimization,Heuristic,Job shop scheduling,Computer science,Scheduling (computing),Semiconductor device fabrication,Heuristics,Batch processing,Distance matrix,Job scheduler
Journal
Volume
Issue
ISSN
52
C
1568-4946
Citations 
PageRank 
References 
6
0.42
15
Authors
3
Name
Order
Citations
PageRank
Shengchao Zhou160.42
Huaping Chen2335.54
Xueping Li3265.39