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

DOI10.1002/(SICI)1099-1425(200005/06)3:3%3C155::AID-JOS39%3E3.0.CO;2-EMaRDI QIDQ1579123zbMATH OpenOpenAlexFDO

Authors Ebru Demirkol, Reha Uzsoy

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%3C155::aid-jos39%3E3.0.co;2-e

zbMATH Keywords

decompositioncomputational analysisschedulingsequence-dependent setup timesreentrant flow shops

Mathematics Subject Classification ID

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

Recommendations

• An approximate solution of the flow-shop problem with sequence dependent setup times
• FLOWSHOP SCHEDULES WITH SEQUENCE DEPENDENT SETUP TIMES
• Flow shop batching and scheduling with sequence-dependent setup times
• scientific article; zbMATH DE number 4074791
• Production sequencing problem with re-entrant work flows and sequence dependent setup times
• Uma propriedade estrutural do problema de programação da produção flow shop permutacional com tempos de setup
• Decomposition algorithms for synchronous flow shop problems with additional resources and setup times
• Efficient methods to schedule re-entrant flowshop system
• A time-decomposition method for sequence-dependent setup scheduling under pressing demand conditions
• Flow Shop No-Wait Scheduling With Sequence Dependent Setup Times And Release Dates

Cites work

• A Computational Study of Local Search Algorithms for Job Shop Scheduling
• A Computational Study of the Job-Shop Scheduling Problem
• A branch and bound algorithm for the job-shop scheduling problem
• A computational study of shifting bottleneck procedures for shop scheduling problems
• A modified shifting bottleneck procedure for job-shop scheduling
• A spatial rule adaptation procedure for reliable production control in a wafer fabrication system
• An Algorithm for Solving the Job-Shop Problem
• Guided local search with shifting bottleneck for job shop scheduling
• Job Shop Scheduling by Local Search
• Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm
• Mean Flow Time Minimization in Reentrant Job Shops with a Hub
• Parallel Taboo Search Techniques for the Job Shop Scheduling Problem
• Performance analysis of scheduling policies in re-entrant manufacturing systems
• Performance of decomposition procedures for job shop scheduling problems with bottleneck machines
• Production sequencing problem with re-entrant work flows and sequence dependent setup times
• Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup times
• The One-Machine Problem with Delayed Precedence Constraints and its Use in Job Shop Scheduling
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• The one-machine sequencing problem

Cited in

(16)

• Integrating a decomposition procedure with problem reduction for factory scheduling with disruptions: a simulation study
• Robust scheduling in a two-machine re-entrant flow shop to minimise the value-at-risk of the makespan: branch-and-bound and heuristic algorithms based on Markovian activity networks and phase-type distributions
• Minimizing total tardiness in a two-machine re-entrant flowshop with sequence-dependent setup times
• Applying machine based decomposition in 2-machine flow shops
• Metaheuristics for solving a flexible flow-shop scheduling problem with s-batching machines
• Genetic algorithm-based subproblem solution procedures for a modified shifting bottleneck heuristic for complex job shops
• Measures of subproblem criticality in decomposition algorithms for shop scheduling
• Decomposition algorithms for synchronous flow shop problems with additional resources and setup times
• Scheduling algorithms for a semiconductor probing facility
• A survey of scheduling problems with setup times or costs
• Minimizing total tardiness on a two-machine re-entrant flowshop
• Hybrid decomposition heuristics for solving large-scale scheduling problems in semiconductor wafer fabrication
• Heuristic algorithms for two machine re-entrant flow shop
• A hybrid scheduling approach for a two-stage flexible flow shop with batch processing machines
• Flow shops with reentry: reversibility properties and makespan optimal schedules
• Minimizing makespan on an \(m\)-machine re-entrant flowshop

This page was built for publication: Decomposition methods for reentrant flow shops with sequence-dependent setup times

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