Decomposition methods for reentrant flow shops with sequence-dependent setup times

DOI<155::AID-JOS39>3.0.CO;2-E 10.1002/(SICI)1099-1425(200005/06)3:3<155::AID-JOS39>3.0.CO;2-EzbMath0965.90020OpenAlexW2021693920MaRDI QIDQ1579123

Reha Uzsoy, Ebru Demirkol

Publication date: 5 August 2001

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/(sici)1099-1425(200005/06)3:3<155::aid-jos39>3.0.co;2-e

zbMATH Keywords

schedulingdecompositionsequence-dependent setup timescomputational analysisreentrant flow shops

Mathematics Subject Classification ID

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

Related Items

Genetic algorithm-based subproblem solution procedures for a modified shifting bottleneck heuristic for complex job shops, Minimizing total tardiness in a two-machine re-entrant flowshop with sequence-dependent setup times, Hybrid decomposition heuristics for solving large-scale scheduling problems in semiconductor wafer fabrication, Scheduling algorithms for a semiconductor probing facility, Heuristic algorithms for two machine re-entrant flow shop, Minimizing makespan on an \(m\)-machine re-entrant flowshop, A hybrid scheduling approach for a two-stage flexible flow shop with batch processing machines, A survey of scheduling problems with setup times or costs, Integrating a decomposition procedure with problem reduction for factory scheduling with disruptions: a simulation study, Flow shops with reentry: reversibility properties and makespan optimal schedules, Measures of subproblem criticality in decomposition algorithms for shop scheduling, Minimizing total tardiness on a two-machine re-entrant flowshop, Applying machine based decomposition in 2-machine flow shops

Cites Work

• The one-machine sequencing problem
• A branch and bound algorithm for the job-shop scheduling problem
• Performance analysis of scheduling policies in re-entrant manufacturing systems
• 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
• A Computational Study of the Job-Shop Scheduling Problem
• A spatial rule adaptation procedure for reliable production control in a wafer fabrication system
• Production sequencing problem with re-entrant work flows and sequence dependent setup times
• Parallel Taboo Search Techniques for the Job Shop Scheduling Problem
• A Computational Study of Local Search Algorithms for Job Shop Scheduling
• Mean Flow Time Minimization in Reentrant Job Shops with a Hub
• Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup times
• 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
• Job Shop Scheduling by Local Search