A genetic algorithm methodology for complex scheduling problems
From MaRDI portal
Recommendations
Cites work
- A block approach for single-machine scheduling with release dates and due dates
- A Computational Study of Local Search Algorithms for Job Shop Scheduling
- A Fast Taboo Search Algorithm for the Job Shop Problem
- A tabu search experience in production scheduling
- Applying tabu search to the job-shop scheduling problem
- Genetic Algorithms and Random Keys for Sequencing and Optimization
- scientific article; zbMATH DE number 702365 (Why is no real title available?)
- scientific article; zbMATH DE number 194544 (Why is no real title available?)
- Job Shop Scheduling by Simulated Annealing
- Matchup Scheduling with Multiple Resources, Release Dates and Disruptions
- Minimizing Total Tardiness on One Machine is NP-Hard
- New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
- Optimization by simulated annealing
- Parallel Taboo Search Techniques for the Job Shop Scheduling Problem
- Tabu Search—Part I
- Tabu Search—Part II
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
Cited in
(46)- Genetic algorithm for the jump number scheduling problem
- The development of genetic algorithms for the finite capacity scheduling of complex products, with multiple levels of product structure.
- An efficient genetic algorithm for job shop scheduling with tardiness objectives.
- Genetic multi-criteria approach to flexible line scheduling
- Solving composite scheduling problems using the hybrid genetic algorithm
- Hybrid flow shop scheduling with sequence dependent family setup time and uncertain due dates
- A comprehensive review of flowshop group scheduling literature
- Diversity controlling genetic algorithm for order acceptance and scheduling problem
- Research on the recognition algorithm concerning geometric boundary regarding heat conduction based on BEM and CGM
- A genetic algorithm for the hybrid flow shop scheduling with unrelated machines and machine eligibility
- Scheduling flexible flow lines with sequence-dependent setup times
- A genetic algorithm for robust schedules in a one-machine environment with ready times and due dates
- A semi-infinite programming model for earliness/tardiness production planning with a genetic algorithm
- Minimisation of total tardiness for identical parallel machine scheduling using genetic algorithm
- A survey of scheduling problems with setup times or costs
- A genetic approach for solving a scheduling problem in a robotized analytical system
- A continuous approach to considering uncertainty in facility design
- scientific article; zbMATH DE number 1703886 (Why is no real title available?)
- An immune algorithm for scheduling a hybrid flow shop with sequence-dependent setup times and machines with random breakdowns
- Scheduling job shop problems with sequence-dependent setup times
- A multi-phase covering Pareto-optimal front method to multi-objective parallel machine scheduling
- Scheduling optimization of a stochastic flexible job-shop system with time-varying machine failure rate
- The Research of Solution to the Problems of Complex Task Scheduling Based on Self-adaptive Genetic Algorithm
- Scheduling parallel-machine batch operations to maximize on-time delivery performance
- Effectiveness of adaptive crossover procedures for a genetic algorithm to schedule unrelated parallel machines with setups
- A new genetic algorithm for solving earliness/tardiness scheduling problem subjected to special process constraint
- scientific article; zbMATH DE number 1487916 (Why is no real title available?)
- scientific article; zbMATH DE number 1488082 (Why is no real title available?)
- Scheduling to minimize product design time using a genetic algorithm
- Applying designed experiments to optimize the performance of genetic algorithms used for scheduling complex products in the capital goods industry
- scientific article; zbMATH DE number 953059 (Why is no real title available?)
- Solving a Class Scheduling Problem with a Genetic Algorithm
- A Simulated Annealing Genetic Algorithm for Solving Timetable Problems
- Un algoritmo genético para un problema de horarios con restricciones especiales
- A Genetic Algorithm for Scheduling Alternative Tasks Subject to Technical Failure
- Parameter estimation of nonlinear systems by dynamic cuckoo search
- A Two-Phase Grammar-Based Genetic Algorithm for a Workshop Scheduling Problem
- Flexible job-shop scheduling problem under resource constraints
- A HYBRID GENETIC ALGORITHM FOR THE EARLY/TARDY SCHEDULING PROBLEM
- Metaheuristics for the multi-objective FJSP with sequence-dependent set-up times, auxiliary resources and machine down time
- Genetic algorithms for task scheduling problem
- Algorithms for a realistic variant of flowshop scheduling
- An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times
- A genetic algorithm for minimizing maximum lateness on parallel identical batch processing machines with dynamic job arrivals and incompatible job families
- Rapid modeling and discovery of priority dispatching rules: An autonomous learning approach
- Minimizing weighted tardiness of job-shop scheduling using a hybrid genetic algorithm
This page was built for publication: A genetic algorithm methodology for complex scheduling problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4239710)
