دانلود رایگان مقاله مکانیسم همکاری مبتنی بر حراج در برنامه ریزی قسمت ها برای کار کارگاهی انعطاف پذیر

ABSTRACT

This paper addresses cell part scheduling (CPS) problem. In this problem, parts may need to visit machines in different cells with consideration Inter-cell transportation time. The processing route of parts can be flexible. The objective is to minimize the overall process make-span. An integer nonlinear programming (INLP) model is formulated to determine the schedule scheme of all parts. An auction-based heuristic approach is proposed to solve it, which focuses on dealing with cooperation between different cells. In this approach, each cell can act as an auctioneer or a bidder. In an auction, it contains call for auction, bid construction, modify bids and winner announcement. A reference matrix is also applied in the auction to guarantee parts to finish as early as possible. Numerical experiments were conducted to test the auction-based approach. The results demonstrate the effectiveness, sensitivity and stability of the proposed auction-based approach, especially suitable for instances in large scale within a short calculating time.

7. Conclusion

This paper addresses flexible multi-cells part scheduling (MCPS) problem. It focuses on how to cooperate between different cells with the objective of minimizing the make-span. An INLP mathematical model is proposed to describe the M-CPS problem. An auction-based approach containing an auction based model and an auction-bid approach is designed to solve it. In an auction, it contains call for auction, bid construction, modify bids and winner announcement. A reference matrix is also applied in the auction to guarantee parts to finish as early as possible. To check the efficiency of the proposed auction-based approach, a series of test problem were generated. The solution obtained by the proposed auctionbased approach was compared to the optimal values obtained by Lingo 11.0 based on the INLP mathematical model and solutions obtained by three kinds of soft computing methods on test problems. These tests demonstrated that the proposed auction-based approach is a good method with high effectiveness and stability for solving this type of scheduling problem, especially when the scale of the problem is large and computation time is short. In practical production, the transportation source is time-restricted usually, such as when it is a robot or vehicles. In future study, the transportation source is sufficient can be tightened as limited according to the proposed problem in our paper, which makes the scenario more close to practical production.