Re-Entrant Production Scheduling Problem under Uncertainty Based on QPSO Algorithm

Abstract

Production scheduling problem is the one of the most basic, important and difficult theoretical research in a manufacturing system. In the past decades of research, the classical scheduling theory has made signficant progress, but the actual scheduling problems are much more complicated than the classical theory. In order to study, the actual scheduling problems are often made much simpler. Therefore, it is difficult for the results of the classical scheduling theory to been put into practice. The considerable gap also exists between the classical scheduling theory and the actual scheduling problem. But with the increasingly fierce market competition, customers have become increasingly demanding product diversification, product life cycle is shorter and more sophisticated structure of the product makes the actual scheduling a large number of uncertainties, the traditional model has become difficult to obtain satisfactory results. This paper makes a analysis on the uncertainties of production scheduling,and tries to solve re-entrant production scheduling problem based on QPSO. It introduces the mathematical model and the solving process based on QPSO algorithm. Then it makes construction strategies to solve it. The paper simulates with Visual C. The results show that this algorithm is feasibility.