A nonstandard job shop scheduling algorithm

According to the characteristics of actual production of discrete manufacturing enterprises, a class of new practical job shop scheduling problem was proposed in this paper. It is called nonstandard job shop scheduling problem. The detailed description of nonstandard job shop scheduling problem is presented. A nonstandard job shop scheduling algorithm was designed. The objective of the algorithm is minimizing the maximal completion time of all operations to ensure all jobs can be processing completed as soon as possible. The nonstandard job shop scheduling algorithm adapts the engineering practice, and it can find the better solution in polynomial complexity. The feasibility and efficiency of the algorithm was verified through an example.