Genetic programming-based hyper-heuristic approach for solving dynamic job shop scheduling problem with extended technical precedence constraints
From MaRDI portal
Publication:2669504
Recommendations
- Genetic programming with adaptive search based on the frequency of features for dynamic flexible job shop scheduling
- A simulation-based study of dispatching rules in a dynamic job shop scheduling problem with batch release and extended technical precedence constraints
- Job shop scheduling with a genetic algorithm and machine learning
- scientific article; zbMATH DE number 4115948
- A new dispatching rule based genetic algorithm for the multi-objective job shop problem
Cites work
- A comparative study of dispatching rules in dynamic flowshops and jobshops
- A multi objective optimization approach for flexible job shop scheduling problem under random machine breakdown by evolutionary algorithms
- A note on the SPT heuristic for solving scheduling problems with generalized due dates
- A simulation-based study of dispatching rules in a dynamic job shop scheduling problem with batch release and extended technical precedence constraints
- A survey of priority rule-based scheduling
- A survey of scheduling problems with setup times or costs
- A Survey of Scheduling Rules
- A weighted modified due date rule for sequencing to minimize weighted tardiness
- Complexity of shop-scheduling problems with fixed number of jobs: a survey
- Development and analysis of cost-based dispatching rules for job shop scheduling
- scientific article; zbMATH DE number 3844997 (Why is no real title available?)
- scientific article; zbMATH DE number 3550182 (Why is no real title available?)
- scientific article; zbMATH DE number 1271322 (Why is no real title available?)
- scientific article; zbMATH DE number 795587 (Why is no real title available?)
- Investigating the use of genetic programming for a classic one-machine scheduling problem
- Learning effective dispatching rules for batch processor scheduling
- Rapid modeling and discovery of priority dispatching rules: An autonomous learning approach
- Scheduling
- The Complexity of Flowshop and Jobshop Scheduling
Cited in
(12)- Selection hyper-heuristics for the multi and many-objective quadratic assignment problem
- Mathematical modelling and heuristic approaches to job-shop scheduling problem with conveyor-based continuous flow transporters
- Dynamic shop-floor scheduling using real-time information: a case study from the thermoplastic industry
- A decision support system based on an artificial multiple intelligence system for vegetable crop land allocation problem
- Scheduling features selection enhanced dispatching decision for dynamic job shop scheduling: a knowledge and data-based approach
- A Q-learning-based multi-objective hyper-heuristic algorithm for energy-efficient integrated distributed hybrid flow-shop scheduling with preventive maintenance
- A novel hyper-heuristic based on surrogate genetic programming for the three-dimensional spatial resource-constrained project scheduling problem under uncertain environments
- Tri-objective lot-streaming scheduling optimization for hybrid flow shops with uncertainties in machine breakdowns and job arrivals using an enhanced genetic programming hyper-heuristic
- A cooperative coevolutionary genetic programming hyper-heuristic for multi-objective makespan and cost optimization in cloud workflow scheduling
- An integrated approach for hybrid flowshop scheduling with setup times and limited buffers in printed circuit board manufacturing system
- Job-shop scheduling problem with limited input buffers: mathematical models and solution methods
- A multi-objective dual hyper-heuristic approach for rescheduling in dynamic flexible job shop
This page was built for publication: Genetic programming-based hyper-heuristic approach for solving dynamic job shop scheduling problem with extended technical precedence constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2669504)
