A hybrid imperialist competitive algorithm for minimizing makespan in a multi-processor open shop

DOI10.1016/j.apm.2013.05.002zbMath1427.90143OpenAlexW2081123989MaRDI QIDQ1792291

Fariborz Jolai, Seyed Morteza Goldansaz, Amir Hossein Zahedi Anaraki

Publication date: 11 October 2018

Published in: Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apm.2013.05.002

zbMATH Keywords

makespangenetic algorithmresponse surface methodologyimperialist competitive algorithmmulti-processor open shop scheduling problems

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (4)

Large-scale medical examination scheduling technology based on intelligent optimization ⋮ Review on nature-inspired algorithms ⋮ Optimizing an inventory model with fuzzy demand, backordering, and discount using a hybrid imperialist competitive algorithm ⋮ Multi-objective open shop scheduling by considering human error and preventive maintenance

Cites Work

• Scheduling open shops with parallel machines to minimize total completion time
• A contribution and new heuristics for open shop scheduling
• Preemptive open shop scheduling with multiprocessors: Polynomial cases and applications
• A projective algorithm for preemptive open shop scheduling with two multiprocessor groups
• A genetic algorithm for the proportionate multiprocessor open shop
• Polynomial time algorithms for two special classes of the proportionate multiprocessor open shop
• Approximation algorithms for the multiprocessor open shop scheduling problem
• Linear time approximation scheme for the multiprocessor open shop problem

This page was built for publication: A hybrid imperialist competitive algorithm for minimizing makespan in a multi-processor open shop