Two-Agent Scheduling on a Bounded Parallel-Batching Machine with Makespan and Maximum Lateness Objectives

作     者：Qi Feng Wei-Ping Shang Cheng-Wen Jiao Wen-Jie Li 

作者机构：College of ScienceZhongyuan University of TechnologyZhengzhou 450007China School of Mathematics and StatisticsZhengzhou UniversityZhengzhou 450001China School of Mathematical SciencesLuoyang Normal UniversityLuoyang 471022China 

出 版 物：《Journal of the Operations Research Society of China》 (中国运筹学会会刊（英文）)

年 卷 期：2020年第8卷第1期

页      面：189-196页

核心收录：

学科分类：1201[管理学-管理科学与工程(可授管理学、工学学位)] 07[理学] 0701[理学-数学] 

基　　金：This research was supported in part by the National Natural Science Foundation of China(Nos.11401604,11571323,11701595,11501279) also supported by Program for Interdisciplinary Direction Team in Zhongyuan University of Technology,China. 

主　　题：Two-agent scheduling Parallel-batching Maximum lateness Pareto optimal points 

摘      要：This paper studies the two-agent scheduling on a bounded parallel-batching machine.In the problem,there are two agents A and B each having their own job sets with the restriction that the processing times of jobs of agent B are equal.The jobs of different agents can be processed in a common batch.Moreover,each agent has its own objective function to be minimized.The objective function of agent A is the makespan of its jobs,and the objective function of agent B is the maximum lateness of its jobs.We present a polynomial-time algorithm for finding all Pareto optimal solutions of this two-agent parallel-batching scheduling problem.