A memetic algorithm for minimizing total weighted tardiness on parallel batch machines with incompatible job families and dynamic job arrival
type: Item
instance of: scholarly article
title: A memetic algorithm for minimizing total weighted tardiness on parallel batch machines with incompatible job families and dynamic job arrival
zbMATH Open document ID: 1231.90183
author: Tsung-Che Chiang
author: Hsueh-Chien Cheng
author: Li-Chen Fu
published in: Computers \& Operations Research
publication date: 2010-09-07T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5780060
zbMATH Keywords: scheduling
zbMATH Keywords: batch processing machine
zbMATH Keywords: memetic algorithm
zbMATH Keywords: total weighted tardiness
describes a project that uses: GALib
MaRDI profile type: Publication
full work available at URL: j.cor.2010.03.017
OpenAlex ID: W1990529873
cites work: Hybrid decomposition heuristics for solving large-scale scheduling problems in semiconductor wafer fabrication
cites work: A multi-criteria approach for scheduling semiconductor wafer fabrication facilities
cites work: Scheduling with batching: A review
cites work: Scheduling batch processing machines with incompatible job families
cites work: Minimizing total weighted tardiness on a single batch process machine with incompatible job families
cites work: Learning effective dispatching rules for batch processor scheduling
cites work: Scheduling a single batch-processing machine with arbitrary job sizes and incompatible job families: An ant colony framework
cites work: Genetic algorithm based scheduling of parallel batch machines with incompatible job families to minimize total weighted tardiness
cites work: Scheduling parallel batch processing machines with arbitrary job sizes and incompatible job families
cites work: Controlling delivery performance in semiconductor manufacturing using Look Ahead Batching
cites work: Minimizing total weighted tardiness on a batch-processing machine with incompatible job families and job ready times
cites work: A genetic algorithm for minimizing maximum lateness on parallel identical batch processing machines with dynamic job arrivals and incompatible job families
cites work: Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times
cites work: Multiobjective scheduling of jobs with incompatible families on parallel batch machines
cites work: Dynamic scheduling of batch-processing machines with non-identical product sizes
cites work: A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes
cites work: Application of genetic algorithms in production and operations management: a review
cites work: A memetic algorithm for the total tardiness single machine scheduling problem
cites work: A hybrid genetic local search algorithm for the permutation flowshop scheduling problem
cites work: A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem
DOI: 10.1016/J.COR.2010.03.017
description: scientific article; zbMATH DE number 5780060