A computational study of shifting bottleneck procedures for shop scheduling problems
From MaRDI portal
Publication:2567845
DOI10.1023/A:1009627429878zbMath1071.90531OpenAlexW1579921200MaRDI QIDQ2567845
Sanjay Mehta, Reha Uzsoy, Ebru Demirkol
Publication date: 13 October 2005
Published in: Journal of Heuristics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1009627429878
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (23)
Configuration and the advantages of the shifting bottleneck procedure for optimizing the job shop total weighted tardiness scheduling problem ⋮ A machine-order search space for job-shop scheduling problems ⋮ Genetic algorithm-based subproblem solution procedures for a modified shifting bottleneck heuristic for complex job shops ⋮ A tabu search/path relinking algorithm to solve the job shop scheduling problem ⋮ Heuristic approaches for scheduling jobs in large-scale flexible job shops ⋮ A bi-objective approach for scheduling ground-handling vehicles in airports ⋮ Instance space analysis and algorithm selection for the job shop scheduling problem ⋮ A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem ⋮ A linear programming-based method for job shop scheduling ⋮ Study on constraint scheduling algorithm for job shop problems with multiple constraint machines ⋮ An advanced tabu search algorithm for the job shop problem ⋮ A hybrid scheduling approach for a two-stage flexible flow shop with batch processing machines ⋮ An extended Akers graphical method with a biased random‐key genetic algorithm for job‐shop scheduling ⋮ Local search and genetic algorithm for the job shop scheduling problem with sequence dependent setup times ⋮ Solving open benchmark instances for the job-shop problem by parallel head-tail adjustments ⋮ Scheduling with product family set-up times: an application in TFT LCD manufacturing ⋮ Integrating a decomposition procedure with problem reduction for factory scheduling with disruptions: a simulation study ⋮ Deterministic job-shop scheduling: Past, present and future ⋮ Measures of subproblem criticality in decomposition algorithms for shop scheduling ⋮ A new hybrid parallel genetic algorithm for the job‐shop scheduling problem ⋮ Decomposition methods for reentrant flow shops with sequence-dependent setup times ⋮ Applying machine based decomposition in 2-machine flow shops ⋮ Combining prospect theory with fuzzy theory to handle disruption in production scheduling
Uses Software
This page was built for publication: A computational study of shifting bottleneck procedures for shop scheduling problems
