Applying machine based decomposition in 2-machine flow shops

DOI10.1016/J.EJOR.2004.10.028MaRDI QIDQ2572846zbMATH OpenOpenAlexFDO

Authors Yanyan Li, Saral Mukherjee, Ashis K. Chatterjee

Publication date 4 November 2005

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2004.10.028, https://web.iima.ac.in/assets/snippets/workingpaperpdf/2002-08-05SaralMukherjee.pdf

zbMATH Keywords

Flow shopJohnson's ruleMachine based decompositionSchedulingShifting bottleneck heuristic

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• The Shifting Bottleneck Procedure for Job Shop Scheduling
• A computational study of shifting bottleneck procedures for shop scheduling problems
• A SHIFTING BOTTLENECK APPROACH FOR A PARALLEL-MACHINE FLOWSHOP SCHEDULING PROBLEM
• The generalized shifting bottleneck procedure
• scientific article; zbMATH DE number 1271322

Cites work

• A branch and bound algorithm for the job-shop scheduling problem
• A computational study of shifting bottleneck procedures for shop scheduling problems
• A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
• A modified shifting bottleneck procedure for job-shop scheduling
• A Survey of Scheduling Rules
• An Algorithm for Solving the Job-Shop Problem
• Decomposition methods for reentrant flow shops with sequence-dependent setup times
• Guided local search with shifting bottleneck for job shop scheduling
• scientific article; zbMATH DE number 5345853 (Why is no real title available?)
• scientific article; zbMATH DE number 1271322 (Why is no real title available?)
• scientific article; zbMATH DE number 2146482 (Why is no real title available?)
• Machine Criticality Measures and Subproblem Solution Procedures in Shifting Bottleneck Methods: A Computational Study
• Optimal two- and three-stage production schedules with set-up time included
• Parallel Taboo Search Techniques for the Job Shop Scheduling Problem
• Surrogate duality relaxation for job shop scheduling
• Technical Note—Dominance Conditions for the Three-Machine Flow-Shop Problem
• The generalized shifting bottleneck procedure
• The job shop scheduling problem: Conventional and new solution techniques
• The One-Machine Problem with Delayed Precedence Constraints and its Use in Job Shop Scheduling
• The one-machine sequencing problem
• The Shifting Bottleneck Procedure for Job Shop Scheduling

Cited in

(2)

• A hybrid scheduling approach for a two-stage flexible flow shop with batch processing machines
• Decomposition approaches in permutation scheduling problems with application to the M-machine flow shop scheduling problems

This page was built for publication: Applying machine based decomposition in 2-machine flow shops

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