Job Shop scheduling problem with continuous stochastic processing time
From MaRDI portal
Publication:5453214
zbMATH Open1174.90526MaRDI QIDQ5453214FDOQ5453214
Authors: Hao Zhu, Wansheng Tang 
Publication date: 4 April 2008
Recommendations
- Chance-constrained model for uncertain job shop scheduling problem
- Job shop scheduling with uncertainty based on genetic algorithm
- An artificial bee colony algorithm for the job shop scheduling problem with random processing times
- A hybrid method for solving stochastic job shop scheduling problems
- A novel parallel quantum genetic algorithm for stochastic job shop scheduling
Approximation methods and heuristics in mathematical programming (90C59) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Stochastic scheduling theory in operations research (90B36)
Cited In (11)
- Job scheduling and management of wearing tools with stochastic tool lifetimes
- An artificial bee colony algorithm for the job shop scheduling problem with random processing times
- Title not available (Why is that?)
- Chance-constrained model for uncertain job shop scheduling problem
- Multi-stage ordinal optimization based approach for job shop scheduling problems
- Rescheduling job shops under random disruptions
- A hybrid method for solving stochastic job shop scheduling problems
- Group shops scheduling with makespan criterion subject to random release dates and processing times
- Title not available (Why is that?)
- A symbolic deduction based scheduling algorithm for a class of complex production scheduling problems
- A holonic approach to flexible flow shop scheduling under stochastic processing times
This page was built for publication: Job Shop scheduling problem with continuous stochastic processing time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5453214)
