Improved Algorithms For Two-Agent Scheduling On An Unbounded Serial-Batching Machine

The paper considers two-agent simultaneous optimization problems on an unbounded serial-batching machine, in which the objective function of agent A is either the maximum lateness or the total completion time and that of agent B is makespan. The above two problems have O(n(B) + n(A)(4))-time algorithm and O(n(A)n(B) + n(A)(4))-time algorithm respectively, where n(X) is the number of jobs owned by agent X (X is an element of {A, B}). In the paper, the running time of the two algorithms is improved to be O(n(B) + n(A)(2) log n(A)) time. (C) 2021 Elsevier B.V. All rights reserved.