AZERINE Abdennour

Faculté de Mathématiques USTHB

Alger, Algerie

Cette adresse e-mail est protégée contre les robots spammeurs. Vous devez activer le JavaScript pour la visualiser.

 

 

Abstract 

 

Multiple-agent scheduling has attracted growing interest in recent years. Most of previous research focused on the single-machine environment. However, some situations make this assumption impractical, since some jobs require to be executed on different machines. In this work, we address a two-machine job shop scheduling problem with two competing agents. The main objective is to minimize the makespan of the first agent subject to an upper bound on the makespan of the...

 

 

 Télécharger l'article : Two-machine job shop scheduling problem with two competing agents