Simultaneous optimization scheduling with two agents on an unbounded serial-batching machine

Abstract

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