A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes
type: Item
instance of: scholarly article
title: A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes
zbMATH Open document ID: 1180.90126
author: Ali Husseinzadeh Kashan
author: Behrooz Karimi
author: Masoud Jenabi
published in: Computers \& Operations Research
publication date: 2008-09-01T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5318739
zbMATH Keywords: simulated annealing
MaRDI profile type: Publication
full work available at URL: j.cor.2006.07.005
OpenAlex ID: W2063271630
cites work: Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
cites work: Efficient scheduling algorithms for a single batch processing machine
cites work: Scheduling with agreeable release times and due dates on a batch processing machine
cites work: Scheduling a batching machine
cites work: Minimizing makespan on a single batch processing machine with dynamic job arrivals
cites work: Scheduling batch processing machines with incompatible job families
cites work: The Batch Loading and Scheduling Problem
cites work: Minimizing number of tardy jobs on a batch processing machine with incompatible job families
cites work: Minimizing total completion time on a batch processing machine with job families
cites work: Scheduling a single batch processing machine with non-identical job sizes
cites work: Minimizing the makespan on a batch machine with non-identical job sizes: An exact procedure
cites work: Minimizing makespan on a single batching machine with release times and non-identical job sizes
cites work: Bounds on Multiprocessing Timing Anomalies
cites work: Genetic algorithm based scheduling of parallel batch machines with incompatible job families to minimize total weighted tardiness
cites work: Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times
cites work: Scheduling parallel batch processing machines with arbitrary job sizes and incompatible job families
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: Scheduling with deadlines and loss functions
cites work: Genetic Algorithms and Random Keys for Sequencing and Optimization
DOI: 10.1016/J.COR.2006.07.005
description: scientific article; zbMATH DE number 5318739