A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem

DOI10.1016/J.COR.2010.09.015zbMATH Open1205.90116OpenAlexW2000958640MaRDI QIDQ622145FDOQ622145

Authors: Kerem Bülbül 

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

Recommendations

• scientific article; zbMATH DE number 1271322
• Shifting bottleneck scheduling for total weighted tardiness minimization -- a computational evaluation of subproblem and re-optimization heuristics
• A tabu search algorithm to minimize total weighted tardiness for the job shop scheduling problem
• Minimizing total weighted tardiness in a generalized job shop
• Configuration and the advantages of the shifting bottleneck procedure for optimizing the job shop total weighted tardiness scheduling problem

zbMATH Keywords

preemptiontabu searchtransportation problemjob shopshifting bottleneckweighted tardiness

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Transportation, logistics and supply chain management (90B06)

Cites Work

• On a routing problem
• Title not available (Why is that?)
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• Scheduling
• A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time
• Guided local search with shifting bottleneck for job shop scheduling
• A large step random walk for minimizing total weighted tardiness in a job shop
• Decomposition methods for large job shops
• A computational study of shifting bottleneck procedures for shop scheduling problems
• Title not available (Why is that?)
• A modified shifting bottleneck procedure for job-shop scheduling
• A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem
• Preemption in single machine earliness/tardiness scheduling
• Deterministic job-shop scheduling: Past, present and future
• A hybrid genetic algorithm for the job shop scheduling problem
• Formulating the single machine sequencing problem with release dates as a mixed integer program
• A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem
• Measures of subproblem criticality in decomposition algorithms for shop scheduling
• Minimizing total weighted tardiness in a generalized job shop
• A new model for the preemptive earliness-tardiness scheduling problem

Cited In (20)

• A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem
• Chance-constrained model for uncertain job shop scheduling problem
• Scatter search for minimizing weighted tardiness in a single machine scheduling with setups
• 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
• 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 tabu search method guided by shifting bottleneck for the job shop scheduling problem
• An exact approach for single machine subproblems in shifting bottleneck procedures for job shops with total weighted tardiness objective
• An improved particle swarm optimization with decline disturbance index (DDPSO) for multi-objective job-shop scheduling 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
• 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
• Evolutionary tabu search for flexible due-date satisfaction in fuzzy job shop scheduling
• Minimizing total weighted tardiness in a generalized job shop
• The job shop scheduling problem with convex costs
• Fuzzy job-shop scheduling problems: a review

This page was built for publication: A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q622145)