Title of article :
Inapproximability results for no-wait job shop scheduling
Author/Authors :
G.J.Gerhard J. Woeginger، نويسنده ,
Issue Information :
دوماهنامه با شماره پیاپی سال 2004
Keywords :
approximation algorithms , APX hardness , Shop scheduling
Journal title :
Operations Research Letters
Journal title :
Operations Research Letters
