Title :
Pareto optimization of serial-batching scheduling problems on two agents
Author :
Qi Feng ; Zhiyun Yu ; Weiping Shang
Author_Institution :
Dept. of Math., Zhengzhou Univ., Zhengzhou, China
Abstract :
This paper studies the two-agent scheduling on an unbounded serial-batching machine. In the problem, there are two agents A and B each having their respective job sets. The jobs of different agent cannot be processed in a common batch. Moreover, each agent has an objective function to be minimized. The objective function of agent A is the makespan of his jobs and the objective function of agent B is maximum lateness of his jobs. The target is to find all Pareto optimal solutions for the two agents. We present a polynomial-time algorithm for finding all Pareto optimal solutions of this two-agent serial-batching scheduling problem.
Keywords :
Pareto optimisation; batch processing (industrial); multi-agent systems; single machine scheduling; Pareto optimization; job makespan; job maximum lateness; objective function; polynomial-time algorithm; serial-batching machine; two-agent serial-batching scheduling problem; Heuristic algorithms; Job shop scheduling; Optimal scheduling; Pareto optimization; Processor scheduling; Schedules; Single machine scheduling;
Conference_Titel :
Advanced Mechatronic Systems (ICAMechS), 2011 International Conference on
Conference_Location :
Zhengzhou
Print_ISBN :
978-1-4577-1698-0
