Study on constraint scheduling algorithm for job shop problems with multiple constraint machines

DOI10.1080/00207540701324143zbMath1159.90412OpenAlexW2133597096MaRDI QIDQ3527958

Yang Zuo, Yu-Geng Xi, Han-Yu Gu

Publication date: 1 October 2008

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

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

zbMATH Keywords

schedulingjob shopconstraint machineshifting bottle neck

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (1)

Bi-level multi-objective mathematical model for job-shop scheduling: the application of Theory of Constraints

Cites Work

• Unnamed Item
• The one-machine sequencing problem
• Extending the shifting bottleneck procedure to real-life applications
• Modelling setup times, process batches and transfer batches using activity network logic
• A branch and bound algorithm for the job-shop scheduling problem
• A computational study of shifting bottleneck procedures for shop scheduling problems
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• An Algorithm for Solving the Job-Shop Problem
• Formulation and solution of the drum-buffer-rope constraint scheduling problem ( DBRCSP)
• Simultaneous versus sequential scheduling of multiple resources which constrain system throughput
• Measures of subproblem criticality in decomposition algorithms for shop scheduling
• Performance of decomposition procedures for job shop scheduling problems with bottleneck machines
• A modified shifting bottleneck procedure for job-shop scheduling
• Rescheduling strategies for minimizing total weighted tardiness in complex job shops
• The One-Machine Problem with Delayed Precedence Constraints and its Use in Job Shop Scheduling

This page was built for publication: Study on constraint scheduling algorithm for job shop problems with multiple constraint machines