Solving multi-agent scheduling problems on parallel machines with a global objective function

DOI10.1051/ro/2014005zbMath1295.90012OpenAlexW2005676724MaRDI QIDQ5418016

Faiza Sadi, Jean-Charles Billaut, Ameur Soukhal

Publication date: 26 May 2014

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=RO_2014__48_2_255_0/

zbMATH Keywords

complexityschedulingdynamic programmingmulti-agent

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)

Related Items (4)

Complexity analyses for multi-agent scheduling problems with a global agent and equal length jobs ⋮ A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems ⋮ An approximation algorithm for multi-agent scheduling on two uniform parallel machines ⋮ Scheduling with release dates and preemption to minimize multiple max-form objective functions

This page was built for publication: Solving multi-agent scheduling problems on parallel machines with a global objective function