OSGA: genetic-based open-shop scheduling with consideration of machine maintenance in small and medium enterprises

DOI10.1007/s10479-015-1855-zzbMath1318.90033OpenAlexW2031012003WikidataQ57830730 ScholiaQ57830730MaRDI QIDQ492852

Maryam Kardgar, Rodina Ahmad, Mohd Hairul Nizam Md. Nasir, Shahaboddin Shamshirband, Ali Asghar Rahmani Hosseinabadi, Mohammad Shojafar

Publication date: 21 August 2015

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-015-1855-z

zbMATH Keywords

schedulinggenetic algorithmtimingopen-shop

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Reliability, availability, maintenance, inspection in operations research (90B25)

Related Items (2)

A new efficient approach for solving the capacitated vehicle routing problem using the gravitational emulation local search algorithm ⋮ Combining prospect theory with fuzzy theory to handle disruption in production scheduling

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Routing open shop and flow shop scheduling problems
• Using the gravitational emulation local search algorithm to solve the multi-objective flexible dynamic job shop scheduling problem in small and medium enterprises
• Scheduling ordered open shops
• A genetic algorithm for the proportionate multiprocessor open shop
• Polynomial time algorithms for two special classes of the proportionate multiprocessor open shop
• The two-machine open-shop problem with unit-time operations and time delays to minimize the makespan
• Classical and new heuristics for the open-shop problem: A computational evaluation
• Constructive heuristic algorithms for the open shop problem
• A branch \(\&\) bound algorithm for the open-shop problem
• A tabu search algorithm for the open shop problem
• Competitive genetic algorithms for the open-shop scheduling problem
• A hybrid genetic algorithm for the open shop scheduling problem
• Benchmarks for basic scheduling problems
• Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop
• A new particle swarm optimization for the open shop scheduling problem
• A Note On The Complexity Of Openshop Scheduling Problems
• Open Shop Scheduling to Minimize Finish Time
• An Overview of Scheduling Problems Arising in Satellite Communications
• Solving the open shop scheduling problem

This page was built for publication: OSGA: genetic-based open-shop scheduling with consideration of machine maintenance in small and medium enterprises