Solving the parallel batch-processing machines with different release times, job sizes, and capacity limits by metaheuristics

Authors:
Hui-Mei Wang;Fuh-Der Chou
Affiliations:
Department of Industrial Management, Vanung University, Jung-Li, Tao Yuan 32045, Taiwan, ROC;Department of Industrial Engineering and Management, Ching Yun University, Jung-Li, Tao Yuan, Taiwan, ROC
Venue:
Expert Systems with Applications: An International Journal
Year:
2010

Citing 7
Cited 0

Efficient algorithms for scheduling semiconductor burn-in operations

Operations Research
Earliness and tardiness scheduling problems on a batch processor

Discrete Applied Mathematics
Minimizing the makespan on a batch machine with non-identical job sizes: an exact procedure

Computers and Operations Research
A genetic algorithm to minimize maximum lateness on a batch processing machine

Computers and Operations Research
Note: minimizing makespan with release times on identical parallel batching machines

Discrete Applied Mathematics
Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times

Computers and Operations Research
Decomposition heuristics for minimizing earliness-tardiness on parallel burn-in ovens with a common due date

Computers and Operations Research

Quantified Score

Hi-index	12.05

Visualization

Abstract

This study addresses the scheduling problem of parallel batch-processing machines encountered in different manufacturing environments, such as the burn-in operation in the manufacture of semiconductors and the aging test operation in the manufacture of thin film transistor-liquid crystal displays (TFT-LCDs). Each machine simultaneously processes several jobs in a batch, as long as the total size of all jobs in the batch does not exceed machine capacity. The processing time of a batch is represented by the longest time among the jobs in the batch. For this problem, a mixed integer programming (MIP) model is provided, and metaheuristics based on simulated annealing (SA) and genetic algorithm (GA) are proposed. In the proposed GA and SA, a string with (n+m-1) numbers is used to assign jobs into each machine. The multi-stage dynamic programming (MSDP) algorithm, taken from the dynamic programming (DP) algorithm of Chou in 2007, is then applied to group the jobs into batches for each machine. The experimental results show that the proposed metaheuristic techniques were successfully employed in solving the scheduling problems of parallel batch-processing machines with makespan criterion.