A novel parallel quantum genetic algorithm for stochastic job shop scheduling
The paper investigates the so-called job-shop-scheduling problem, i.e., there is a certain number of jobs that have to be completed on a given number of machines according to a given sequence of operations. The processing times of the jobs on the machines are assumed to be normally distributed. The objective is to find a strategy that minimizes the sum of the expected completion times for the jobs. To solve this problem a parallel quantum genetic algorithm is proposed. The performance of the algorithm is tested by means of three ``standard benchmark problems using simulations.
- A novel competitive co-evolutionary quantum genetic algorithm for stochastic job shop scheduling problem
- Quantum-inspired genetic algorithms for flow shop scheduling
- Improved quantum genetic algorithm in application of scheduling engineering personnel
- Application of quantum approximate optimization algorithm to job shop scheduling problem
- A new hybrid parallel genetic algorithm for the job-shop scheduling problem
- A novel hybrid quantum-inspired evolutionary algorithm for permutation flow-shop scheduling
- Discrete quantum-behaved particle swarm optimization for job-shop scheduling
- A contribution to the stochastic flow shop scheduling problem.
- A hybrid method for solving stochastic job shop scheduling problems
- Approximation Algorithms for 2-Stage Stochastic Scheduling Problems
- Approximation and Online Algorithms
- Models and Algorithms for Stochastic Online Scheduling
- Rollout algorithms for stochastic scheduling problems
- Stochastic Machine Scheduling with Precedence Constraints
- Stochastic scheduling to minimize expected maximum lateness
- Theory and practice of uncertain programming
- A novel competitive co-evolutionary quantum genetic algorithm for stochastic job shop scheduling problem
- Optimal computing budget allocation for ordinal optimization in solving stochastic job shop scheduling problems
- Improved quantum genetic algorithm in application of scheduling engineering personnel
- A dual heterogeneous island genetic algorithm for solving large size flexible flow shop scheduling problems on hybrid multicore CPU and GPU platforms
- A simulation-optimization framework for generating dynamic dispatching rules for stochastic job shop with earliness and tardiness penalties
- An improved hybrid quantum optimization algorithm for solving nonlinear equations
- Genetic algorithm based parallel jobs scheduling in distributed computing system
- An effective new island model genetic algorithm for job shop scheduling problem
- Quantum-inspired genetic algorithms for flow shop scheduling
- Minimizing makespan for scheduling stochastic job shop with random breakdown
- An artificial bee colony algorithm for the job shop scheduling problem with random processing times
- Consultation sequencing of a hospital with multiple service points using genetic programming
- Quantum-inspired evolutionary algorithms: a survey and empirical study
- Job Shop scheduling problem with continuous stochastic processing time
- Application of quantum approximate optimization algorithm to job shop scheduling problem
- Two-stage stochastic/robust scheduling based on permutable operation groups
- Knowledge-driven co-evolutionary algorithm for flexible job shop scheduling problem with consistent sublots
This page was built for publication: A novel parallel quantum genetic algorithm for stochastic job shop scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1018336)
