A simulation-optimization framework for generating dynamic dispatching rules for stochastic job shop with earliness and tardiness penalties

DOI10.1016/J.COR.2021.105650MaRDI QIDQ2669778zbMATH OpenOpenAlexFDO

Authors Mehdy Morady Gohareh, Ehsan Mansouri

Publication date 9 March 2022

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2021.105650

zbMATH Keywords

ant colonycentral limit theoremearliness-tardiness penaltyMarkov decision processsimulation-optimizationstochastic job shop scheduling

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Recommendations

• New dispatching rules for shop scheduling: A step forward
• Dynamic scheduling of stochastic jobs on a single machine
• scientific article; zbMATH DE number 912601
• Using dispatching rules for job shop scheduling with due date-based objectives
• A comparative study of dispatching rules in dynamic flowshops and jobshops

Cites work

• A best possible on-line algorithm for two-machine flow shop scheduling to minimize makespan
• A genetic algorithm and the Monte Carlo method for stochastic job-shop scheduling
• A hybrid method for solving stochastic job shop scheduling problems
• A multi objective optimization approach for flexible job shop scheduling problem under random machine breakdown by evolutionary algorithms
• A novel competitive co-evolutionary quantum genetic algorithm for stochastic job shop scheduling problem
• A novel parallel quantum genetic algorithm for stochastic job shop scheduling
• Chance-constrained model for uncertain job shop scheduling problem
• Evolutionary tabu search for flexible due-date satisfaction in fuzzy job shop scheduling
• Fuzzy job-shop scheduling problems: a review
• Minimizing makespan for scheduling stochastic job shop with random breakdown
• Mixed integer linear programming and constraint programming models for the online printing shop scheduling problem
• Multi-stage ordinal optimization based approach for job shop scheduling problems
• Optimal computing budget allocation for ordinal optimization in solving stochastic job shop scheduling problems
• Optimizing makespan and stability risks in job shop scheduling
• Risk measure of job shop scheduling with random machine breakdowns
• Scheduling optimization of a stochastic flexible job-shop system with time-varying machine failure rate
• Scheduling. Theory, algorithms, and systems
• The Ant Colony Optimization Metaheuristic: Algorithms, Applications, and Advances

Cited in

(6)

• Dispatching rule selection with Gaussian processes
• Integrating a decomposition procedure with problem reduction for factory scheduling with disruptions: a simulation study
• An exact quadratic programming approach based on convex reformulation for seru scheduling problems
• Metamodel-based simulation optimization considering a single stochastic constraint
• Efficient optimization in stochastic production planning problems with product substitution
• Scheduling features selection enhanced dispatching decision for dynamic job shop scheduling: a knowledge and data-based approach

This page was built for publication: A simulation-optimization framework for generating dynamic dispatching rules for stochastic job shop with earliness and tardiness penalties

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2669778)