Extended GRASP for the job shop scheduling problem with total weighted tardiness objective
From MaRDI portal
Publication:1753631
DOI10.1016/j.ejor.2017.03.030zbMath1403.90304OpenAlexW2597312407MaRDI QIDQ1753631
Christian Bierwirth, Jens Kuhpfahl
Publication date: 29 May 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2017.03.030
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (8)
Evolutionary tabu search for flexible due-date satisfaction in fuzzy job shop scheduling ⋮ Shop scheduling in manufacturing environments: a review ⋮ An integrated dynamic facility layout and job shop scheduling problem: a hybrid NSGA-II and local search algorithm ⋮ Program trace optimization with constructive heuristics for combinatorial problems ⋮ A general efficient neighborhood structure framework for the job-shop and flexible job-shop scheduling problems ⋮ The job shop scheduling problem with convex costs ⋮ Parallel machine scheduling with the total weighted delivery time performance measure in distributed manufacturing ⋮ An efficient GRASP-like algorithm for the multi-product straight pipeline scheduling problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A study on local search neighborhoods 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 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
- 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
- Minimizing total weighted tardiness in a generalized job shop
- A probabilistic heuristic for a computationally difficult set covering problem
- An efficient genetic algorithm for job shop scheduling with tardiness objectives.
- A large step random walk for minimizing total weighted tardiness in a job shop
- Decomposition methods for large job shops
- Benchmarks for basic scheduling problems
- Applying tabu search to the job-shop scheduling problem
- A weighted modified due date rule for sequencing to minimize weighted tardiness
- 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
- Guided Local Search with Shifting Bottleneck for Job Shop Scheduling
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
- A Survey of Scheduling Rules
- A Fast Taboo Search Algorithm for the Job Shop Problem
- GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization
- New dispatching rules for shop scheduling: A step forward
- A neighbourhood property for the job shop scheduling problem with application to hybrid particle swarm optimization
- Algorithms for Solving Production-Scheduling Problems
This page was built for publication: Extended GRASP for the job shop scheduling problem with total weighted tardiness objective
