This paper considers a class of simultaneous optimization scheduling with two competitive agents on an unbounded serial-batching machine. The cost function each agent depends the completion times its jobs only. According to whether from different can be processed in common batch, compatible model and incompatible are investigated. For model, we consider batch availability item availability. pro...