Performance of decomposition procedures for job shop scheduling problems with bottleneck machines

DOI10.1080/002075400188843MaRDI QIDQ4497287zbMATH OpenOpenAlexFDO

Authors Reha Uzsoy, Cheng-Shuo Wang

Publication date 22 August 2000

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

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

Mathematics Subject Classification ID

Production models (90B30)

Recommendations

• Practical job shop scheduling
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• The generalized shifting bottleneck procedure
• A computational study of shifting bottleneck procedures for shop scheduling problems

Cited in

(12)

• Analysis of the temporal decomposition procedure for scheduling with release and due dates
• Augmented neural networks for task scheduling.
• Decomposition methods for reentrant flow shops with sequence-dependent setup times
• Permutation flow shop scheduling with earliness and tardiness penalties
• 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
• Measures of subproblem criticality in decomposition algorithms for shop scheduling
• Job shop scheduling considering material handling
• Modelling and rescheduling of a re-entrant wafer fabrication line involving machine unreliability
• Problem Decomposition and Multi-shot ASP Solving for Job-shop Scheduling
• Decomposition strategies and multi-shot ASP solving for job-shop scheduling
• Hybrid decomposition heuristics for solving large-scale scheduling problems in semiconductor wafer fabrication

This page was built for publication: Performance of decomposition procedures for job shop scheduling problems with bottleneck machines

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