A hybrid imperialist competitive algorithm for minimizing makespan in a multi-processor open shop
type: Item
instance of: scholarly article
title: A hybrid imperialist competitive algorithm for minimizing makespan in a multi-processor open shop
zbMATH Open document ID: 1427.90143
author: Seyed Morteza Goldansaz
author: Fariborz Jolai
author: Amir Hossein Zahedi Anaraki
published in: Applied Mathematical Modelling
publication date: 2018-10-11T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6952133
zbMATH Keywords: multi-processor open shop scheduling problems
zbMATH Keywords: makespan
zbMATH Keywords: imperialist competitive algorithm
zbMATH Keywords: genetic algorithm
zbMATH Keywords: response surface methodology
MaRDI profile type: Publication
full work available at URL: j.apm.2013.05.002
OpenAlex ID: W2081123989
cites work: A contribution and new heuristics for open shop scheduling
cites work: Scheduling open shops with parallel machines to minimize total completion time
cites work: A genetic algorithm for the proportionate multiprocessor open shop
cites work: Polynomial time algorithms for two special classes of the proportionate multiprocessor open shop
cites work: A projective algorithm for preemptive open shop scheduling with two multiprocessor groups
cites work: Preemptive open shop scheduling with multiprocessors: Polynomial cases and applications
cites work: Linear time approximation scheme for the multiprocessor open shop problem
cites work: Approximation algorithms for the multiprocessor open shop scheduling problem
DOI: 10.1016/J.APM.2013.05.002
description: scientific article; zbMATH DE number 6952133