Xiwen Lu

A new approximation algorithm for multi-agent scheduling to minimize makespan on two machines

This paper studies a multi-agent scheduling problem on two identical parallel machines. There are g agents, and each agent’s objective is to minimize its makespan. We present an approximation algorithm such that the performance ratio of the makespan achieved by our algorithm relative to the minimum makespan is no more than

Supply chain scheduling problem in the hospital with periodic working time on a single machine

i+\frac{1}{6}

An algorithm for multi-agent scheduling to minimize the makespan on m parallel machines

i+16 for the ith

Asymptotically optimal policy for stochastic job shop scheduling problem to minimize makespan

(i=1,2,\ldots ,g)

A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines

(i=1,2,…,g) completed agent. Moreover, we show that the performance ratio is tight.

Global convergence of BFGS and PRP methods under a modified weak Wolfe–Powell line search☆☆☆

A two-agent scheduling problem on parallel machines is considered. Our objective is to minimize the makespan for agent A, subject to an upper bound on the makespan for agent B. When the number of machines, denoted by