Bounded parallel-batching scheduling with two competing agents

Two-agent single-machine scheduling to minimize the batch delivery cost

“…They provide plynomial-time and pseudo-polynomial-time algorithms to solve problems involving various combinations of some regular objective functions when the job families are either incompatible or compatible. Fan, Cheng, Li, and Feng (2013) consider two-agent scheduling on a common bounded parallelbatching machine, where the objective is to minimize the makespan or total completion time of one agent, subject to an upper bound on the makespan of the other agent. They show that the makespan problem is polynomially solvable for the incompatible case and is NP-hard in the ordinary sense for the compatible case, and that the total completion time problem is NP-hard and is polynomially solvable for the incompatible case with a fixed number of job types.…”

A shuffled frog-leaping algorithm for hybrid flow shop scheduling with two agents

“…Li and Yuan (2012) consider the constrained optimization problem with an unbounded parallel-batch machines and two agents and provide polynomial-time and pseudo-polynomial-time algorithm. Fan, Cheng, Li, and Feng (2013) study the NP-hard feature and polynomial solvability of bounded parallel-batching scheduling with two competing agents and different objectives. Zhao and Lu (2015) Some studies have considered multi-agent scheduling in flow shop environments.…”

Two-phase neighborhood search algorithm for two-agent hybrid flow shop scheduling problem

“…Elvikis et al [10] discuss the problem with two conflicting objectives and provide polynomial time algorithms for solving the problem. Fan et al [11] study the NP-hard feature and polynomial solvability of bounded parallel-batching scheduling with two competing agents and different objectives.…”