A large step random walk for minimizing total weighted tardiness in a job shop
From MaRDI portal
(Redirected from Publication:1579121)
Recommendations
- A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem
- scientific article; zbMATH DE number 1271322
- Minimizing total weighted tardiness in a generalized job shop
- Shifting bottleneck scheduling for total weighted tardiness minimization -- a computational evaluation of subproblem and re-optimization heuristics
- A study on local search neighborhoods for the job shop scheduling problem with total weighted tardiness objective
Cites work
- scientific article; zbMATH DE number 4079162 (Why is no real title available?)
- scientific article; zbMATH DE number 1271322 (Why is no real title available?)
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- A Computational Study of Local Search Algorithms for Job Shop Scheduling
- A Fast Taboo Search Algorithm for the Job Shop Problem
- A survey of priority rule-based scheduling
- A user's guide to tabu search
- Applying tabu search to the job-shop scheduling problem
- Global optimization
- Job Shop Scheduling by Local Search
- Job Shop Scheduling by Simulated Annealing
- Job-shop scheduling: Computational study of local search and large-step optimization methods
- Large-step Markov chains for the TSP incorporating local search heuristics
- On a routing problem
- Optimization by simulated annealing
- Parallel Taboo Search Techniques for the Job Shop Scheduling Problem
- Tabu Search—Part I
Cited in
(23)- A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem
- 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
- An efficient genetic algorithm for job shop scheduling with tardiness objectives.
- Extended GRASP for the job shop scheduling problem with total weighted tardiness objective
- Configuration and the advantages of the shifting bottleneck procedure for optimizing the job shop total weighted tardiness scheduling problem
- Automatically evolving preference-based dispatching rules for multi-objective job shop scheduling
- A general approach for optimizing regular criteria in the job-shop scheduling problem
- A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem
- A tabu search algorithm to minimize total weighted tardiness for the job shop scheduling problem
- Minimizing weighted tardiness of job-shop scheduling using a hybrid genetic algorithm
- An exact approach for single machine subproblems in shifting bottleneck procedures for job shops with total weighted tardiness objective
- Evolutionary Computation in Combinatorial Optimization
- A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardiness objective
- A study on local search neighborhoods for the job shop scheduling problem with total weighted tardiness objective
- Heuristic approaches for scheduling jobs in large-scale flexible job shops
- Shifting bottleneck scheduling for total weighted tardiness minimization -- a computational evaluation of subproblem and re-optimization heuristics
- Enhancing local search algorithms for job shops with MIN-sum objectives by approximate move evaluation
- A linear programming-based method for job shop scheduling
- Computing lower and upper bounds for a large-scale industrial job shop scheduling problem
- Minimizing total weighted tardiness in a generalized job shop
- The job shop scheduling problem with convex costs
- An iterated local search algorithm for the lot-streaming flow shop scheduling problem
This page was built for publication: A large step random walk for minimizing total weighted tardiness in a job shop
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1579121)
