مرکز منطقه ای اطلاع رساني علوم و فناوري - Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling Original Research Article

Title of article :

Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling Original Research Article

Author/Authors :

Liron Yedidsion، نويسنده , , Dvir Shabtay، نويسنده , , Moshe Kaspi، نويسنده ,

Issue Information :

روزنامه با شماره پیاپی سال 2011

Pages :

From page :

1264

To page :

1278

Keywords :

Controllable processing times , Complexity , Resource allocation , Bicriteria optimization , Assignment problem , Scheduling

Journal title :

Discrete Applied Mathematics

Serial Year :

2011

Journal title :

Discrete Applied Mathematics

Record number :

887674

Link To Document :