The Research On Heuristic Algorithm Of Considering Job Cost Bicriteria Parallel Batch Scheduling Problem

As a production scheduling problem in the manufacturing field of application has a strong background in combination optimization problem, it refers to a certain time within a production planning and allocation of tasks in order to achieve the goal of one or several indexes.Reasonable and targeted scheduling scheme has played a tremendous role in improving production efficiency and promoting the rational utilization of limited resources. However, due to the actual production scheduling problems often have multiple constraints, target problems, and many kinds of random uncertainties and other characteristics, resulting in a number of scheduling problems have not been properly reasonable solved.Many of these problems have been shown to belong to the NP-hard problem, so how to design a simple and efficient algorithm based on the complex production scheduling environment is the emphasis of the study.Firstly, this paper introduces the basic concept of scheduling problems, including the description of a specific scheduling problem in the general representation method, according to the different research angle of scheduling problem of classification and its main research method. Secondly, introduces the four necessary conditions of constituting classical scheduling problems. One of the assumptions of the classical scheduling problem. One of the assumptions of the classical scheduling problem that any machine at any time can only process one job.But in the actual industrial production environment, in order to shorten the processing time and increase productivity, some machines can simultaneously process multiple jobs, modem scheduling problem is this type of batch scheduling problem. Finally, a branch of this paper is to study the batch scheduling problem: batch scheduling with non-identical job sizes, the jobs to be processed is different in size, but the jobs belong to the same batch must meet their sum of the size can not exceed the machine capacity conditions. Compared to the classic scheduling and batch scheduling with same size (unit size), the complexity of the batch scheduling with non-identical job sizes problem is much more complex and it adapt to the modern needs in production environment.This paper discuss the research on considering job cost bicriteria parallel machines batch scheduling problem, but the current research on parallel machines environment focused on how to improve production efficiency, the optimization objective function is mainly a function of time (Makespan Cmax、total completion time ΣCj). However, with the proposed concept of green manufacturing, the energy efficiency issues in production is also increasingly prominent. In the existing study of batch scheduling problem related to the cost, the main consideration is the cost of batch delivery (the customers have requirement for the delivery time of each batch), while ignoring the job is allocated as a separate object when the costs incurred. Consider the bicriteria of parallel machines for batch scheduling job processing costs, this paper proposes a heuristic optimization algorithm. For bicriteria optimization based on staging ideas, to minimize the total completion time for the first goal, in order to minimize the total cost of machining MOC for the second goal. For batch scheduling process in two stages:batch and batch sequencing, respectively, the use of heuristics BFLPS and rank-s to be addressed. Through simulation experiments, the design heuristic algorithm will compare to genetic algorithm and the existing literature in the performance and gives performance analysis, experimental results demonstrate that the effectiveness of the proposed algorithm for optimizing the bicriteria parallel machine batch scheduling.