Matching operation constrained job shop scheduling problem based on backward heuristic scheduling algorithm

摘要

The matching operation constrained job shop scheduling problem in manufacturing field is studied based on classical scheduling theory. General job shop scheduling whose constraints mainly require working procedures to be sequential, the constraints we considered are further enriched by matching machining, results in much more complicated solvability. A mathematical model of matching operation constrained job shop scheduling problem is established. In order to assure the delivery time, the backward heuristic scheduling algorithm is proposed to solve the model. Finally, a case is presented to verify the algorithm and simulation result is given for comparison.