An artificial bee colony algorithm for the job shop scheduling problem with random processing times
From MaRDI portal
Publication:400942
DOI10.3390/E13091708zbMath1305.90218OpenAlexW2078114979MaRDI QIDQ400942
Publication date: 26 August 2014
Published in: Entropy (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3390/e13091708
Related Items (2)
Optimal computing budget allocation for ordinal optimization in solving stochastic job shop scheduling problems ⋮ Improved metaheuristic-based energy-efficient clustering protocol with optimal base station location in wireless sensor networks
Cites Work
- Unnamed Item
- EA/G-GA for single machine scheduling problems with earliness/tardiness costs
- A novel parallel quantum genetic algorithm for stochastic job shop scheduling
- A survey on metaheuristics for stochastic combinatorial optimization
- A novel competitive co-evolutionary quantum genetic algorithm for stochastic job shop scheduling problem
- Deterministic job-shop scheduling: Past, present and future
- Mean flow time minimization with given bounds of processing times
- A comparative study of artificial bee colony algorithm
- A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm
- An advanced tabu search algorithm for the job shop problem
- A genetic algorithm for the flexible job-shop scheduling problem
- A hybrid method for solving stochastic job shop scheduling problems
- A Genetic Algorithm Approach to Solving Stochastic Job-shop Scheduling Problems
- Forecasting policies for scheduling a stochastic due date job shop
- A genetic algorithm and the Monte Carlo method for stochastic job-shop scheduling
- Finite-time analysis of the multiarmed bandit problem
This page was built for publication: An artificial bee colony algorithm for the job shop scheduling problem with random processing times
