Search Results - subject:"Multi-agent scheduling"

An iterative combinatorial auction mechanism for multi-agent parallel machine scheduling

Liu, Yaqiong; Sun, Shudong; Wang, Xi Vincent; Wang, Lihui - In: International journal of production research 60 (2022) 1, pp. 361-380

Persistent link: https://www.econbiz.de/10012873151

Scheduling two interfering job sets on identical parallel machines with makespan and total completion time minimization

Rault, Tifenn; Sadi, Faiza; Billaut, Jean-Charles; … - In: Journal of scheduling : JOS 27 (2024) 5, pp. 485-505

Persistent link: https://www.econbiz.de/10015123330

Minmax common due-window assignment and scheduling on a single machine with two competing agents

Mor, Baruch - In: Journal of the Operational Research Society 69 (2018) 4, pp. 589-602

Persistent link: https://www.econbiz.de/10012225741

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

Zhao, Kejun; Lu, Xiwen; Gu, Manzhan - In: Journal of scheduling 19 (2016) 1, pp. 21-31

Persistent link: https://www.econbiz.de/10011450517

A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: Multi-agent scheduling problems

Perez-Gonzalez, Paz; Framinan, Jose M. - In: European Journal of Operational Research 235 (2014) 1, pp. 1-16

lacks a unified view, the studied problems have received different names (such as interfering jobs, multi-agent scheduling …

Persistent link: https://www.econbiz.de/10010744222

A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs : multi-agent scheduling problems

Perez-Gonzalez, Paz; Framinan, Jose M. - In: European journal of operational research : EJOR 235 (2014) 1, pp. 1-16

Persistent link: https://www.econbiz.de/10010361416

Scheduling problems with two competing agents to minimize minmax and minsum earliness measures

Mor, Baruch; Mosheiov, Gur - In: European Journal of Operational Research 206 (2010) 3, pp. 540-546

A relatively new class of scheduling problems consists of multiple agents who compete on the use of a common processor. We focus in this paper on a two-agent setting. Each of the agents has a set of jobs to be processed on the same processor, and each of the agents wants to minimize a measure...

Persistent link: https://www.econbiz.de/10008494808