A genetic algorithm methodology for complex scheduling problems
From MaRDI portal
Publication:4239710
DOI<199::AID-NAV5>3.0.CO;2-L 10.1002/(SICI)1520-6750(199903)46:2<199::AID-NAV5>3.0.CO;2-LzbMath0918.90086OpenAlexW2053343005MaRDI QIDQ4239710
Bryan A. Norman, James C. Bean
Publication date: 4 August 1999
Full work available at URL: https://doi.org/10.1002/(sici)1520-6750(199903)46:2<199::aid-nav5>3.0.co;2-l
Related Items
Scheduling flexible flow lines with sequence-dependent setup times, A multi-phase covering Pareto-optimal front method to multi-objective parallel machine scheduling, Hybrid flow shop scheduling with sequence dependent family setup time and uncertain due dates, An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times, Scheduling optimization of a stochastic flexible job-shop system with time-varying machine failure rate, A comprehensive review of flowshop group scheduling literature, Scheduling parallel-machine batch operations to maximize on-time delivery performance, 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, Metaheuristics for the multi-objective FJSP with sequence-dependent set-up times, auxiliary resources and machine down time, Parameter Estimation of Nonlinear Systems by Dynamic Cuckoo Search, Research on the recognition algorithm concerning geometric boundary regarding heat conduction based on BEM and CGM, An efficient genetic algorithm for job shop scheduling with tardiness objectives., A survey of scheduling problems with setup times or costs, Minimizing weighted tardiness of job-shop scheduling using a hybrid genetic algorithm, 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, Algorithms for a realistic variant of flowshop scheduling, Flexible job-shop scheduling problem under resource constraints, A continuous approach to considering uncertainty in facility design
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
- A block approach for single-machine scheduling with release dates and due dates
- A tabu search experience in production scheduling
- Applying tabu search to the job-shop scheduling problem
- Minimizing Total Tardiness on One Machine is NP-Hard
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- Matchup Scheduling with Multiple Resources, Release Dates and Disruptions
- Job Shop Scheduling by Simulated Annealing
- Tabu Search—Part I
- Tabu Search—Part II
- New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
- Parallel Taboo Search Techniques for the Job Shop Scheduling Problem
- A Computational Study of Local Search Algorithms for Job Shop Scheduling
- Genetic Algorithms and Random Keys for Sequencing and Optimization
- A Fast Taboo Search Algorithm for the Job Shop Problem
