Extended GRASP for the job shop scheduling problem with total weighted tardiness objective
From MaRDI portal
(Redirected from Publication:1753631)
Recommendations
- A study on local search neighborhoods 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
- A tabu search algorithm to minimize total weighted tardiness for the job shop scheduling problem
- A hybrid differential evolution and tree search algorithm for the job shop scheduling problem
- A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem
Cites work
- scientific article; zbMATH DE number 1271322 (Why is no real title available?)
- scientific article; zbMATH DE number 2209652 (Why is no real title available?)
- A Fast Taboo Search Algorithm for the Job Shop Problem
- A PMBGA to optimize the selection of rules for job shop scheduling based on the Giffler-Thompson algorithm
- A Survey of Scheduling Rules
- A general approach for optimizing regular criteria in the job-shop scheduling problem
- A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem
- A graph-theoretic decomposition of the job shop scheduling problem to achieve scheduling robustness
- A grasp for job shop scheduling
- A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem
- A large step random walk for minimizing total weighted tardiness in a job shop
- A neighbourhood property for the job shop scheduling problem with application to hybrid particle swarm optimization
- A probabilistic heuristic for a computationally difficult set covering problem
- 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
- A weighted modified due date rule for sequencing to minimize weighted tardiness
- Algorithms for Solving Production-Scheduling Problems
- An efficient genetic algorithm for job shop scheduling with tardiness objectives.
- Applying tabu search to the job-shop scheduling problem
- Benchmarks for basic scheduling problems
- Decomposition methods for large job shops
- Enhancing local search algorithms for job shops with MIN-sum objectives by approximate move evaluation
- GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization
- Guided local search with shifting bottleneck for job shop scheduling
- Minimizing total weighted tardiness in a generalized job shop
- New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
- New dispatching rules for shop scheduling: A step forward
- The Shifting Bottleneck Procedure for Job Shop Scheduling
Cited in
(13)- An integrated dynamic facility layout and job shop scheduling problem: a hybrid NSGA-II and local search algorithm
- An efficient GRASP-like algorithm for the multi-product straight pipeline scheduling problem
- Minimizing the expected maximum lateness for a job shop subject to stochastic machine breakdowns
- Parallel machine scheduling with the total weighted delivery time performance measure in distributed manufacturing
- A study on local search neighborhoods for the job shop scheduling problem with total weighted tardiness objective
- Shop scheduling in manufacturing environments: a review
- Program trace optimization with constructive heuristics for combinatorial problems
- An intensification approach based on fitness landscape characteristics for job shop scheduling problem
- Evolutionary tabu search for flexible due-date satisfaction in fuzzy job shop scheduling
- A job scheduling and rejection problem considering self-contained and cross-functional jobs
- The job shop scheduling problem with convex costs
- A general efficient neighborhood structure framework for the job-shop and flexible job-shop scheduling problems
- On the optimal modeling and evaluation of job shops with a total weighted tardiness objective: constraint programming vs. mixed integer programming
This page was built for publication: Extended GRASP for the job shop scheduling problem with total weighted tardiness objective
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1753631)
