A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem
From MaRDI portal
Publication:622145
DOI10.1016/J.COR.2010.09.015zbMath1205.90116OpenAlexW2000958640MaRDI QIDQ622145
Publication date: 31 January 2011
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2010.09.015
Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (16)
Configuration and the advantages of the shifting bottleneck procedure for optimizing the job shop total weighted tardiness scheduling problem ⋮ An improved particle swarm optimization with decline disturbance index (DDPSO) for multi-objective job-shop 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 ⋮ Scatter search for minimizing weighted tardiness in a single machine scheduling with setups ⋮ Chance-constrained model for uncertain job shop scheduling problem ⋮ Evolutionary tabu search for flexible due-date satisfaction in fuzzy job shop scheduling ⋮ 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 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 ⋮ Fuzzy job-shop scheduling problems: a review ⋮ Extended GRASP for the job shop scheduling problem with total weighted tardiness objective ⋮ The job shop scheduling problem with convex costs ⋮ A tabu search algorithm to minimize total weighted tardiness for the job shop scheduling problem
Cites Work
- Unnamed Item
- Unnamed Item
- A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem
- Preemption in single machine earliness/tardiness scheduling
- Minimizing total weighted tardiness in a generalized job shop
- Formulating the single machine sequencing problem with release dates as a mixed integer program
- A new model for the preemptive earliness-tardiness scheduling problem
- A large step random walk for minimizing total weighted tardiness in a job shop
- Decomposition methods for large job shops
- Deterministic job-shop scheduling: Past, present and future
- A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time
- A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem
- A hybrid genetic algorithm for the job shop scheduling problem
- A computational study of shifting bottleneck procedures for shop scheduling problems
- Guided Local Search with Shifting Bottleneck for Job Shop Scheduling
- On a routing problem
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Measures of subproblem criticality in decomposition algorithms for shop scheduling
- A modified shifting bottleneck procedure for job-shop scheduling
- Scheduling
This page was built for publication: A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem
