| 4 | MINIMIZING JOB SHOP INVENTORY WITH ON-TIME DELIVERY GUARANTEES显示文摘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. | Leyuan SHI Yunpeng PANDepartment of Industrial Engineering, University of Wisconsin 1513 University Ave., Madison, WI 53706, USA | 2003 | Systems Science and Systems Engineering2003，12，4： | 0 |
您所在的机构暂未开通此部分的功能，请联系管理员