Abstract
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(nB+nA4)-time algorithm and O(nAnB+nA4)-time algorithm respectively, where nX is the number of jobs owned by agent X(X∈{A,B}). In the paper, the running time of the two algorithms is improved to be O(nB+nA2lognA) time.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
