Research On Job-Shop Scheduling Algorithm Based On Remain Function

The Production Scheduling Problem is very important in the domain of automatic management, and Job-Shop Scheduling Problem is a practical Production Scheduling Problem. Job-Shop Scheduling Algorithm is one of the important problem of scheduling theory, which can not only promote the study of scheduling theory, but also make the production plans of enterprise reasonable.Job-Shop Scheduling Problem is a class of large combinatorial optimum problem with sequence and resources constraints, which is a classical NP-hard. Nonstandard Job-Shop Scheduling Problem slacks the resources constraints, and gets larger search space. The fact that it is impossible to find the global optimum in polynomial complexity has been proved. In this paper, through the analysis and study of Job-Shop Scheduling Problem and Nonstandard Job-Shop Scheduling Problem, Job-Shop Scheduling Algorithm Based on Remain Function and Nonstandard Job-Shop Scheduling Efficiency Algorithm are proposed. This algorithm adapts the engineering practice, and it can find the better solution in polynomial complexity. The main idea of this paper is described as follows.First, the author briefly introduces the studying level of Scheduling Problem and the advantage of Job-Shop Scheduling Algorithm Based on Remain Function and Nonstandard Job-Shop Scheduling Efficiency Algorithm.Second, the detailed description of JSSABRF and NJSSEA are presented, including the description of JSSP and NJSSP, cost function, detailed steps of the algorithm and the instance of scheduling.At last, a class of more practical sequence problem is offered, which is the NJSSP with related operations — Multi-class Related Job-Shop SchedulingProblem . The solving algorithm is also presented.