Minimizing the expected maximum lateness for a job shop subject to stochastic machine breakdowns
From MaRDI portal
Publication:6588509
DOI10.1007/S10479-023-05592-ZzbMATH Open1545.90092MaRDI QIDQ6588509
Gabriel Mauricio Zambrano-Rey, Andrea Rivera-Torres, Eliana María González-Neira, Gabriel Fernando Forero-Ortiz, María José Ocampo-Monsalve
Publication date: 15 August 2024
Published in: Annals of Operations Research (Search for Journal in Brave)
Could not fetch data.
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A hybrid evolutionary algorithm to solve the job shop scheduling problem
- 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
- A rollout metaheuristic for job shop scheduling problems
- A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem
- Fuzzy job shop scheduling with lot-sizing
- Optimal computing budget allocation for ordinal optimization in solving stochastic job shop scheduling problems
- A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation
- Extended GRASP for the job shop scheduling problem with total weighted tardiness objective
- Greedy randomized adaptive search procedures
- Deterministic job-shop scheduling: Past, present and future
- A computationally efficient branch-and-bound algorithm for the permutation flow-shop scheduling problem
- An advanced tabu search algorithm for the job shop problem
- Optimizing makespan and stability risks in job shop scheduling
- Optimal two- and three-stage production schedules with set-up time included
- Dynamic job shop scheduling using variable neighbourhood search
- Integrating a decomposition procedure with problem reduction for factory scheduling with disruptions: a simulation study
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- Box-Type Approximations in Nonparametric Factorial Designs
- Proactive release procedures for just-in-time job shop environments, subject to machine failures
- Linguistic-based meta-heuristic optimization model for flexible job shop scheduling
- A Non-Numerical Approach to Production Scheduling Problems
- Scheduling
This page was built for publication: Minimizing the expected maximum lateness for a job shop subject to stochastic machine breakdowns
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6588509)