Maximizing the service level on the makespan in the stochastic flexible job-shop scheduling problem
From MaRDI portal
Publication:6106559
DOI10.1016/j.cor.2023.106237OpenAlexW4362722793MaRDI QIDQ6106559
Valeria Borodin, Stéphane Dauzère-Pérès, Mario Flores-Gómez
Publication date: 3 July 2023
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2023.106237
schedulingtabu searchmakespanservice levelstochasticflexible job-shopMonte Carlo sampling-based approximation
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Scheduling optimization of a stochastic flexible job-shop system with time-varying machine failure rate
- A general approach for optimizing regular criteria in the job-shop scheduling problem
- Genetic algorithm-based subproblem solution procedures for a modified shifting bottleneck heuristic for complex job shops
- Scheduling with uncertain durations: Modeling \(\beta \)-robust scheduling with constraints
- Job-shop scheduling with multi-purpose machines
- Tabu search for the job-shop scheduling problem with multi-purpose machines
- An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search
- A hierarchical approach for the FMS scheduling problem
- Solving the flexible job shop scheduling problem with sequence-dependent setup times
- A batch-oblivious approach for complex job-shop scheduling problems
- Uncertain convex programs: randomized solutions and confidence levels
- Tool capacity planning in semiconductor manufacturing.
- An efficient Pareto approach for solving the multi-objective flexible job-shop scheduling problem with regular criteria
- Multiobjective optimization for complex flexible job-shop scheduling problems
- Routing and scheduling in a flexible job shop by tabu search
- A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems
- A genetic algorithm for the flexible job-shop scheduling problem
- Real-time production scheduling in the Industry-4.0 context: addressing uncertainties in job arrivals and machine breakdowns
- A research survey: review of flexible job shop scheduling techniques
- Multilevel Monte Carlo Methods
- Introduction to Stochastic Programming
- A Sample Approximation Approach for Optimization with Probabilistic Constraints
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- The Complexity of Flowshop and Jobshop Scheduling
- Handbook of metaheuristics
This page was built for publication: Maximizing the service level on the makespan in the stochastic flexible job-shop scheduling problem
