A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem
From MaRDI portal
Publication:2471233
Recommendations
- Minimizing weighted tardiness of job-shop scheduling using a hybrid genetic algorithm
- An efficient genetic algorithm for job shop scheduling with tardiness objectives.
- Minimizing total weighted tardiness in a generalized job shop
- A tabu search algorithm to minimize total weighted tardiness for the job shop scheduling problem
- A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem
Cites work
- A Fast Taboo Search Algorithm for the Job Shop Problem
- A genetic algorithm for the job shop problem
- A hybrid genetic algorithm for the job shop scheduling problem
- A hybrid genetic algorithm for the open shop scheduling problem
- A large step random walk for minimizing total weighted tardiness in a job shop
- Algorithms for Solving Production-Scheduling Problems
- An efficient genetic algorithm for job shop scheduling with tardiness objectives.
- Decomposition methods for large job shops
- Deterministic job-shop scheduling: Past, present and future
- Evolution based learning in a job shop scheduling environment
- scientific article; zbMATH DE number 1271322 (Why is no real title available?)
- Job Shop Scheduling by Simulated Annealing
- Job-shop scheduling: Computational study of local search and large-step optimization methods
- New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Parallel Taboo Search Techniques for the Job Shop Scheduling Problem
Cited in
(43)- Order acceptance using genetic algorithms
- Computing minimal doubly resolving sets of graphs
- Genetic algorithms to minimize the weighted number of late jobs on a single machine.
- An efficient genetic algorithm for job shop scheduling with tardiness objectives.
- A two-machine flowshop scheduling problem with precedence constraint on two jobs
- Metaheuristics for order scheduling problem with unequal ready times
- Extended GRASP for the job shop scheduling problem with total weighted tardiness objective
- The job shop scheduling problem with convex costs
- Coupling genetic local search and recovering beam search algorithms for minimizing the total completion time in the single machine scheduling problem subject to release dates
- Genetic algorithm for job scheduling with maintenance consideration in semiconductor manufacturing process
- Evolutionary tabu search for flexible due-date satisfaction in fuzzy job shop scheduling
- On the optimal modeling and evaluation of job shops with a total weighted tardiness objective: constraint programming vs. mixed integer programming
- A priority-based genetic algorithm for a flexible job shop scheduling problem
- Using a family of critical ratio-based approaches to minimize the number of tardy jobs in the job shop with sequence dependent setup times
- A single-machine two-agent scheduling problem by GA approach
- A hybrid evolutionary algorithm to solve the job shop scheduling problem
- Genetic tabu search for the fuzzy flexible job shop problem
- A study on local search neighborhoods for the job shop scheduling problem with total weighted tardiness objective
- Shifting bottleneck scheduling for total weighted tardiness minimization -- a computational evaluation of subproblem and re-optimization heuristics
- Heuristic approaches for scheduling jobs in large-scale flexible job shops
- Enhancing local search algorithms for job shops with MIN-sum objectives by approximate move evaluation
- A hybrid differential evolution and tree search algorithm for the job shop scheduling problem
- A PMBGA to optimize the selection of rules for job shop scheduling based on the Giffler-Thompson algorithm
- A general approach for optimizing regular criteria in the job-shop scheduling problem
- An exact approach for single machine subproblems in shifting bottleneck procedures for job shops with total weighted tardiness objective
- Two-agent single-machine scheduling of jobs with time-dependent processing times and ready times
- A hybrid iterated local search algorithm with adaptive perturbation mechanism by success-history based parameter adaptation for differential evolution (SHADE)
- Genetic algorithm for a two-agent scheduling problem with truncated learning consideration
- Advances in Neural Networks – ISNN 2005
- Metaheuristics for the multi-objective FJSP with sequence-dependent set-up times, auxiliary resources and machine down time
- A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardiness objective
- A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem
- Genetic algorithm for minimizing the total weighted completion time scheduling problem with learning and release times
- Solving scheduling problems from high-level models
- Solving a real-life multi-skill resource-constrained multi-project scheduling problem
- A two-machine flowshop scheduling problem with a truncated sum of processing-times-based learning function
- Local search genetic algorithms for the job shop scheduling problem
- Algorithms for a realistic variant of flowshop scheduling
- A tabu search algorithm to minimize total weighted tardiness for the job shop scheduling problem
- Minimizing total weighted tardiness in a generalized job shop
- Comparing efficiencies of genetic crossover operators for one machine total weighted tardiness problem
- Minimizing weighted tardiness of job-shop scheduling using a hybrid genetic algorithm
- A memetic algorithm for minimizing total weighted tardiness on parallel batch machines with incompatible job families and dynamic job arrival
This page was built for publication: A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2471233)
