A result on the quasi-physics and quasi-human algorithm for solving the job shop scheduling problem

The job shop scheduling problem with minimizing make-span is discussed. A basic quasi-physics and quasi-human algorithm (BQ&Q) that is a new method for the problem is proposed. The algorithm is based on an elastic model of the problem and the schedule is created by the strategy of quasi-physics and quasi-human. A theorem about the feasibility of BQ&Q is proved, which guarantees that BQ&Q can be used as a very useful basic procedure to design much more effective and efficient heuristic algorithm for the problem.