A memetic algorithm for minimizing total weighted tardiness on parallel batch machines with incompatible job families and dynamic job arrival

Authors:
Tsung-Che Chiang;Hsueh-Chien Cheng;Li-Chen Fu
Affiliations:
Department of Computer Science and Information Engineering, National Taiwan Normal University, Taiwan, ROC;Department of Computer Science and Information Engineering, National Taiwan University, Taiwan, ROC;Department of Computer Science and Information Engineering, National Taiwan University, Taiwan, ROC and Department of Electrical Engineering, National Taiwan University, Taiwan, ROC
Venue:
Computers and Operations Research
Year:
2010

Citing 12
Cited 4

Priority rules for job shops with weighted tardiness costs

Management Science
Scheduling a batch processing machine with incompatible job families

Computers and Industrial Engineering
A genetic algorithm to minimize maximum lateness on a batch processing machine

Computers and Operations Research
Minimizing total weighted tardiness on a single batch process machine with incompatible job families

Computers and Operations Research
Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times

Computers and Operations Research
Hybrid decomposition heuristics for solving large-scale scheduling problems in semiconductor wafer fabrication

Journal of Scheduling
A genetic algorithm for minimizing maximum lateness on parallel identical batch processing machines with dynamic job arrivals and incompatible job families

Computers and Operations Research
A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes

Computers and Operations Research
A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem

Computers and Operations Research
A multi-criteria approach for scheduling semiconductor wafer fabrication facilities

Journal of Scheduling
Multiobjective scheduling of jobs with incompatible families on parallel batch machines

EvoCOP'06 Proceedings of the 6th European conference on Evolutionary Computation in Combinatorial Optimization
Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling

IEEE Transactions on Evolutionary Computation

A branch and bound algorithm for minimizing total completion time on a single batch machine with incompatible job families and dynamic arrivals

Computers and Operations Research
Survey: Enhancing rule-based scheduling in wafer fabrication facilities by evolutionary algorithms: Review and opportunity

Computers and Industrial Engineering
Study on optimization potential influencing factors in simulation studies focused on parallel batch machine scheduling using variable neighbourhood search

Proceedings of the Winter Simulation Conference
A comparison of heuristics to solve a single machine batching problem with unequal ready times of the jobs

Proceedings of the Winter Simulation Conference

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper addresses a scheduling problem motivated by scheduling of diffusion operations in the wafer fabrication facility. In the target problem, jobs arrive at the batch machines at different time instants, and only jobs belonging to the same family can be processed together. Parallel batch machine scheduling typically consists of three types of decisions-batch forming, machine assignment, and batch sequencing. We propose a memetic algorithm with a new genome encoding scheme to search for the optimal or near-optimal batch formation and batch sequence simultaneously. Machine assignment is resolved in the proposed decoding scheme. Crossover and mutation operators suitable for the proposed encoding scheme are also devised. Through the experiment with 4860 problem instances of various characteristics including the number of machines, the number of jobs, and so on, the proposed algorithm demonstrates its advantages over a recently proposed benchmark algorithm in terms of both solution quality and computational efficiency.