A large step random walk for minimizing total weighted tardiness in a job shop
From MaRDI portal
Publication:1579121
DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1099-1425(200005/06)3:3<125::AID-JOS40>3.0.CO;2-C" /><125::AID-JOS40>3.0.CO;2-C 10.1002/(SICI)1099-1425(200005/06)3:3<125::AID-JOS40>3.0.CO;2-CzbMath0969.90045OpenAlexW2051604785MaRDI QIDQ1579121
Publication date: 4 September 2000
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/(sici)1099-1425(200005/06)3:3<125::aid-jos40>3.0.co;2-c
Related Items (22)
Configuration and the advantages of the shifting bottleneck procedure for optimizing the job shop total weighted tardiness scheduling 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 ⋮ Minimizing total weighted tardiness in a generalized job shop ⋮ A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardiness objective ⋮ Enhancing local search algorithms for job shops with MIN-sum objectives by approximate move evaluation ⋮ A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness 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 ⋮ A general approach for optimizing regular criteria in the job-shop scheduling problem ⋮ Automatically evolving preference-based dispatching rules for multi-objective job shop scheduling ⋮ A linear programming-based method for job shop scheduling ⋮ An exact approach for single machine subproblems in shifting bottleneck procedures for job shops with total weighted tardiness objective ⋮ An efficient genetic algorithm for job shop scheduling with tardiness objectives. ⋮ A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem ⋮ Extended GRASP for the job shop scheduling problem with total weighted tardiness objective ⋮ The job shop scheduling problem with convex costs ⋮ Minimizing weighted tardiness of job-shop scheduling using a hybrid genetic algorithm ⋮ An Iterated Local Search Algorithm for the Lot-Streaming Flow Shop Scheduling Problem ⋮ Computing lower and upper bounds for a large-scale industrial job shop scheduling problem ⋮ A tabu search algorithm to minimize total weighted tardiness for the job shop scheduling problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- A survey of priority rule-based scheduling
- Large-step Markov chains for the TSP incorporating local search heuristics
- Job-shop scheduling: Computational study of local search and large-step optimization methods
- A user's guide to tabu search
- Applying tabu search to the job-shop scheduling problem
- On a routing problem
- Job Shop Scheduling by Simulated Annealing
- Tabu Search—Part I
- Parallel Taboo Search Techniques for the Job Shop Scheduling Problem
- A Computational Study of Local Search Algorithms for Job Shop Scheduling
- A Fast Taboo Search Algorithm for the Job Shop Problem
- Job Shop Scheduling by Local Search
- Global optimization
This page was built for publication: A large step random walk for minimizing total weighted tardiness in a job shop
