OSGA: genetic-based open-shop scheduling with consideration of machine maintenance in small and medium enterprises
DOI10.1007/S10479-015-1855-ZzbMATH Open1318.90033OpenAlexW2031012003WikidataQ57830730 ScholiaQ57830730MaRDI QIDQ492852FDOQ492852
Authors: Shahaboddin Shamshirband, Mohammad Shojafar, Ali Asghar Rahmani Hosseinabadi, Maryam Kardgar, Mohd Hairul Nizam Md. Nasir, Rodina Ahmad 
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
Recommendations
- Retraction note to: ``OSGA: genetic-based open-shop scheduling with consideration of machine maintenance in small and medium enterprises
- A hybrid genetic algorithm for the open shop scheduling problem
- Competitive genetic algorithms for the open-shop scheduling problem
- A genetic algorithm for scheduling open shops with sequence-dependent setup times
- SOLVING THE OPEN SHOP SCHEDULING PROBLEM VIA A HYBRID GENETIC-VARIABLE NEIGHBORHOOD SEARCH ALGORITHM
- A genetic algorithm for scheduling open shops with conflict graphs to minimize the makespan
- scientific article; zbMATH DE number 5812137
- scientific article; zbMATH DE number 5137248
Reliability, availability, maintenance, inspection in operations research (90B25) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Open Shop Scheduling to Minimize Finish Time
- Benchmarks for basic scheduling problems
- Scheduling ordered open shops
- Constructive heuristic algorithms for the open shop problem
- A genetic algorithm for the proportionate multiprocessor open shop
- Polynomial time algorithms for two special classes of the proportionate multiprocessor open shop
- A new particle swarm optimization for the open shop scheduling problem
- Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop
- Routing open shop and flow shop scheduling problems
- 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
- 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
- A Note On The Complexity Of Openshop Scheduling Problems
- An Overview of Scheduling Problems Arising in Satellite Communications
- Using the gravitational emulation local search algorithm to solve the multi-objective flexible dynamic job shop scheduling problem in small and medium enterprises
- Solving the open shop scheduling problem
Cited In (3)
- Retraction note to: ``OSGA: genetic-based open-shop scheduling with consideration of machine maintenance in small and medium enterprises
- 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
This page was built for publication: OSGA: genetic-based open-shop scheduling with consideration of machine maintenance in small and medium enterprises
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q492852)
