Pages that link to "Item:Q2572011"
From MaRDI portal
The following pages link to A hybrid method for solving stochastic job shop scheduling problems (Q2572011):
Displayed 12 items.
- Minimizing makespan for scheduling stochastic job shop with random breakdown (Q388592) (← links)
- An artificial bee colony algorithm for the job shop scheduling problem with random processing times (Q400942) (← links)
- Real-time production planning and control system for job-shop manufacturing: a system dynamics analysis (Q421712) (← links)
- An agent-based parallel approach for the job shop scheduling problem with genetic algorithms (Q630749) (← links)
- Group shops scheduling with makespan criterion subject to random release dates and processing times (Q733535) (← links)
- The museum visitor routing problem (Q969135) (← links)
- A novel parallel quantum genetic algorithm for stochastic job shop scheduling (Q1018336) (← links)
- A novel competitive co-evolutionary quantum genetic algorithm for stochastic job shop scheduling problem (Q1046710) (← links)
- Hybrid flow shop scheduling with sequence dependent family setup time and uncertain due dates (Q1630186) (← links)
- Multi-stage ordinal optimization based approach for job shop scheduling problems (Q2449225) (← links)
- A simulation-optimization framework for generating dynamic dispatching rules for stochastic job shop with earliness and tardiness penalties (Q2669778) (← links)
- Consultation sequencing of a hospital with multiple service points using genetic programming (Q5058855) (← links)