论文部分内容阅读
In this paper, we introduce a new job shop model that minimizes a well-motivated inventory measure while assuring on-time job deliveries. For this new problem, we introduce precise notation and formalization. A decomposition scheme is discussed in detail, which is subsequently utilized in a new shifting bottleneck procedure (SBP) for the problem. In addition to SBP, we propose another heuristic method based on successive insertion of operations. Algorithms are fine tuned through experimentation. Moreover, the two heuristic procedures are compared in terms of computation time and solution quality, using disguised actual factory data.
In this paper, we introduce a new job shop model that minimizes a well-motivated inventory measure while assuring on-time job deliveries. For this new problem, we introduce precise notation and formalization. A decomposition scheme is discussed in detail, that is, utilized in a new shifting bottleneck procedure (SBP) for the problem. In addition to SBP, we propose another heuristic method based on successive insertion of operations. Moreover, the two heuristic procedures are compared in terms of computation time and solution quality, using disguised actual factory data.