In order to solve the problem of vehicle scheduling to feed parts at automobile assembly line, this study proposes a just-in-time delivery method combined with the mode of material supermarket. A mixed integer linear programming model with the primary objective of using the least number of tow trains is constructed by considering capacity of vehicle and inventory levels of line. On the basis of the minimum number of tow trains, the schedule of each tour is reasonably planned to minimize inventory of assembly line, which is the secondary objective of the part supply problem. Additionally, a heuristic algorithm which can obtain a satisfactory solution in a short time is designed to solve large-scale problems after considering continuity and complexity of modern automobile production. Furthermore, some cases are analyzed and compared with the widely used periodic delivery strategy, and the feasibility of just-in-time model and algorithm is verified. The results reveal that just-in-time delivery strategy has more advantages in reducing inventory level than periodic delivery strategy.
2 January 2014 in Discrete Dynamics in Nature and Society
This paper deals with the advanced planning and scheduling (APS) problem with multilevel structured products. A constraint programming model is constructed for the problem with the consideration of precedence constraints, capacity constraints, release time and due date. A new constraint programming (CP) method is proposed to minimize the total cost. This method is based on iterative solving via branch and bound. And, at each node, the constraint propagation technique is adapted for domain filtering and consistency check. Three branching strategies are compared to improve the search speed. The results of computational study show that the proposed CP method performs better than the traditional mixed integer programming (MIP) method. And the binary constraint heuristic branching strategy is more effective than the other two branching strategies.
With the increase in product varieties, the combination of supermarkets and tow trains is being adopted by more automobile manufacturers for part feeding, especially in mixed-flow assembly lines. This paper focuses on the routing, scheduling, and loading problems of a single towed train that transports parts from one supermarket to the workstation buffer in a mixed-flow assembly line and aims to optimize the loading of the tow train, the optimal delivery schedule and route, and the appropriate departure time to minimize shipping and line inventory costs. To enable part feeding in line with the just-in-time (JIT) principle, a new mixed-integer mathematical model from nonlinearity to linearity and a novel artificial immune genetic algorithm-based heuristic are proposed. Both methods can provide reasonable solutions compared by minimizing the route length and inventory level in terms of speed, and the genetic algorithm shows better performance on a large scale.