Local search genetic algorithms for the job shop scheduling problem
type: Item
instance of: scholarly article
title: Local search genetic algorithms for the job shop scheduling problem
zbMATH Open document ID: 1078.68597
DOI: 10.1023/B:APIN.0000027769.48098.91
author: Beatrice M. Ombuki
author: M. Ventresca
published in: Applied Intelligence
publication date: 2005-01-19T00:00:00Z
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 68T20
Mathematics Subject Classification ID: 68W05
zbMATH DE Number: 2129335
zbMATH Keywords: Genetic algorithms
zbMATH Keywords: local search
zbMATH Keywords: tabu search
zbMATH Keywords: job shop scheduling
zbMATH Keywords: combinatorial optimization
describes a project that uses: JOBSHOP
MaRDI profile type: Publication
full work available at URL: b:apin.0000027769.48098.91
OpenAlex ID: W2017773796
Recommended article: Local search and genetic algorithm for the job shop scheduling problem with sequence dependent setup times
Recommended article: An Improved Local Search Genetic Algorithm with Multi-crossover for Job Shop Scheduling Problem
Recommended article: Q4730766
Recommended article: A genetic algorithm for the job shop problem
Recommended article: A hybrid genetic algorithm for the job shop scheduling problem
Recommended article: Genetic local search for multi-objective flowshop scheduling problems
Recommended article: A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem
Recommended article: A genetic algorithm for the flexible job-shop scheduling problem
Recommended article: A genetic algorithm applied to a classic job-shop scheduling problem
Recommended article: Q5453402
description: scientific article; zbMATH DE number 2129335