Scheduling larger job shops: a decomposition approach

DOI10.1080/00207549608905010zbMath0928.90036OpenAlexW2062905994MaRDI QIDQ4230201

Rajan Batta, Dake Sun

Publication date: 1996

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

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

zbMATH Keywords

job shop schedulingcell schedulinglarge scale job scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Production models (90B30)

Related Items (1)

A prediction based iterative decomposition algorithm for scheduling large-scale job shops

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Future paths for integer programming and links to artificial intelligence
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• An Algorithm for Solving the Job-Shop Problem
• Job-Shop Scheduling by Implicit Enumeration
• Algorithms for Solving Production-Scheduling Problems

This page was built for publication: Scheduling larger job shops: a decomposition approach