Optimal computing budget allocation for ordinal optimization in solving stochastic job shop scheduling problems
From MaRDI portal
Publication:1718781
DOI10.1155/2014/619254zbMath1407.90195OpenAlexW2041942729WikidataQ59066614 ScholiaQ59066614MaRDI QIDQ1718781
Changkai Xia, Yangyang Lv, Hong-an Yang, Honghao Wang, ShuDong Sun
Publication date: 8 February 2019
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2014/619254
Related Items (1)
Cites Work
- Unnamed Item
- An artificial bee colony algorithm for the job shop scheduling problem with random processing times
- A novel parallel quantum genetic algorithm for stochastic job shop scheduling
- A novel competitive co-evolutionary quantum genetic algorithm for stochastic job shop scheduling problem
- Convergence properties of ordinal comparison in the simulation of discrete event dynamic systems
- A fuzzy robust scheduling approach for product development projects.
- Simulation budget allocation for further enhancing the efficiency of ordinal optimization
- Evolution strategies. A comprehensive introduction
- Fuzzy programming for multiobjective job shop scheduling with fuzzy processing time and fuzzy duedate through genetic algorithms
- A new approach to discrete stochastic optimization problems
- Performance of an ant colony optimisation algorithm in dynamic job shop scheduling problems
- A genetic algorithm for flexible job shop scheduling with fuzzy processing time
- Dynamic job shop scheduling using variable neighbourhood search
- Interval scheduling: A survey
- Ordinal Optimization
- Dynamics and convergence rate of ordinal comparison of stochastic discrete-event systems
- Explanation of goal softening in ordinal optimization
- A genetic algorithm and the Monte Carlo method for stochastic job-shop scheduling
This page was built for publication: Optimal computing budget allocation for ordinal optimization in solving stochastic job shop scheduling problems
