Two heuristic algorithms of job scheduling problem with inter-cell production mode in hybrid operations of machining

The purpose of this research is to clarify and optimize the job shop scheduling problem under the environment of hybrid operations of machining. The machining operations of the jobs could not be finished in its own plant and thus inter-cell productions are considered. First, we clarify the features of the above job shop scheduling problem in detail and propose a new optimization criterion which accords with fact problems. Second, we set up a mathematical model for such job shop scheduling problem. Then, we bring up two heuristic algorithms named JSBGAHEU (Joint Scheduling-based) and SCMC-HEU (System-Coordinated based Min Cost) whose chromosomes have two layer structures to solve the model. The optimal solution of the former algorithm is taken as the reference points of calculating the fitness of the latter algorithm. At last, we analyze the proper application scope of the two algorithms through changing their parameters.