A contribution and new heuristics for open shop scheduling
type: Item
instance of: scholarly article
title: A contribution and new heuristics for open shop scheduling
zbMATH Open document ID: 1171.90403
author: S. M. T. Fatemi Ghomi
author: Bahman Naderi
author: Majid Aminnayeri
author: Mostafa Zandieh
published in: Computers \& Operations Research
publication date: 2009-10-16T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5616476
zbMATH Keywords: scheduling
zbMATH Keywords: open shop
zbMATH Keywords: constructive heuristic
zbMATH Keywords: encoding scheme
zbMATH Keywords: permutation
zbMATH Keywords: redundancy
zbMATH Keywords: insertion and reinsertion operators
MaRDI profile type: Publication
full work available at URL: j.cor.2009.04.010
OpenAlex ID: W2001808054
cites work: A new particle swarm optimization for the open shop scheduling problem
cites work: Heuristic constructive algorithms for open shop scheduling to minimize mean flow time
cites work: Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop
cites work: Constructive heuristic algorithms for the open shop problem
cites work: A branch \(\&\) bound algorithm for the open-shop problem
cites work: An iterative improvement approach for the nonpreemptive open shop scheduling problem
cites work: Classical and new heuristics for the open-shop problem: A computational evaluation
cites work: A new lower bound for the open-shop problem
cites work: Solving the open shop scheduling problem
cites work: A hybrid genetic algorithm for the open shop scheduling problem
cites work: Competitive genetic algorithms for the open-shop scheduling problem
cites work: Scheduling job shop problems with sequence-dependent setup times
cites work: Benchmarks for basic scheduling problems
cites work: Q3525910
cites work: Q5445111
DOI: 10.1016/J.COR.2009.04.010
Recommended article: New efficient heuristics for scheduling open shops with makespan minimization
Recommended article: A new heuristic for open shop total completion time problem
Recommended article: Classical and new heuristics for the open-shop problem: A computational evaluation
Recommended article: Heuristic constructive algorithms for open shop scheduling to minimize mean flow time
Recommended article: Q5210297
Recommended article: Constructive heuristic algorithms for the open shop problem
Recommended article: The Open Shop Scheduling Problem
Recommended article: A Note On The Complexity Of Openshop Scheduling Problems
Recommended article: Solving the open shop scheduling problem
Recommended article: Q3801319
description: scientific article; zbMATH DE number 5616476