مرکز منطقه ای اطلاع رساني علوم و فناوري - A -approximation algorithm for the two-machine routing open-shop problem on a two-node network

Title of article :

A -approximation algorithm for the two-machine routing open-shop problem on a two-node network

Author/Authors :

Igor Averbakh، نويسنده , , Oded Berman، نويسنده , , Ilya Chernykh، نويسنده ,

Issue Information :

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

Pages :

From page :

To page :

Keywords :

Scheduling , Approximation algorithms , combinatorial optimization

Journal title :

European Journal of Operational Research

Serial Year :

2005

Journal title :

European Journal of Operational Research

Record number :

215529

Link To Document :