Scheduling Problems Associated With Bi-objective Scheduling And Batch Scheduling

In this paper, we study scheduling problems that they are the combination of batch scheduling and multi-objective scheduling and multi-agent scheduling. For each model presented in this paper gives the optimal algorithm, and also analyzing the optimal computational complexity.This paper discusses two models:the first one is the scheduling problems that it is the combination of the parallel scheduling and bi-objective scheduling and multi-agent scheduling, it contains two types of incompatible task set. We consider the problem of scheduling n jobs on a single batch processing machine in which jobs are ordered by two customers. Jobs belonging to different customers are processed based on their individual criteria. In this article, we find the optimal sequencing batch of the model. We also analyze the optimal computational complexity.The second model is the scheduling problems that it is the combination of the batch scheduling and bi-objective scheduling ,this model uses the modified Smith rule to find Pareto optimal points of the entire model.There is an upper bound on the number of Pareto optimal points. And we also analyze the optimal computational complexity in the model.