Measures of subproblem criticality in decomposition algorithms for shop scheduling

DOI10.1080/0020754021000037856zbMath1038.90031OpenAlexW2052079467MaRDI QIDQ4460042

Haldun Aytug, R. Uzoy, Karl Kempf

Publication date: 18 May 2004

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/0020754021000037856

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Decomposition methods (49M27)

Related Items (6)

Genetic algorithm-based subproblem solution procedures for a modified shifting bottleneck heuristic for complex job shops ⋮ Heuristic approaches for scheduling jobs in large-scale flexible job shops ⋮ Hybrid decomposition heuristics for solving large-scale scheduling problems in semiconductor wafer fabrication ⋮ A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem ⋮ Study on constraint scheduling algorithm for job shop problems with multiple constraint machines ⋮ Integrating a decomposition procedure with problem reduction for factory scheduling with disruptions: a simulation study

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The one-machine sequencing problem
• Benchmarks for shop scheduling problems
• A branch and bound algorithm for the job-shop scheduling problem
• Evolution based learning in a job shop scheduling environment
• Decomposition methods for reentrant flow shops with sequence-dependent setup times
• A computational study of shifting bottleneck procedures for shop scheduling problems
• Guided Local Search with Shifting Bottleneck for Job Shop Scheduling
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• An Algorithm for Solving the Job-Shop Problem
• New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
• A Computational Study of the Job-Shop Scheduling Problem
• Indentifying attributes for knowledge-based development in dynamic scheduling environments
• A Fast Taboo Search Algorithm for the Job Shop Problem
• Performance of decomposition procedures for job shop scheduling problems with bottleneck machines
• A modified shifting bottleneck procedure for job-shop scheduling
• The One-Machine Problem with Delayed Precedence Constraints and its Use in Job Shop Scheduling
• Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm

This page was built for publication: Measures of subproblem criticality in decomposition algorithms for shop scheduling