چكيده لاتين :
This study presents a heuristic approach based on Shifting Bottleneck (SB) for large scale job shop scheduling problems. Subproblem solution procedure and reoptimization are two important factors in SB approach that can increase computational efforts. In large scale problems, we need effective procedures to decrease the computational efforts. This study, first, presents a modified Schrage algorithm for single machine scheduling problems with heads and tails that is an effective subproblem solution procedure. Then we present a heuristic approach for job shop scheduling that resolve reoptimization difficulties in SB. Finally, the proposed algorithm is tested and validated. Experiment results show the superiority of our approach in comparison to SB in large scale problems especially in computational efforts. This approach can be a good initial seed in using search techniques.
