مرکز منطقه ای اطلاع رساني علوم و فناوري - The single machine batching problem with identical family setup times to minimize maximum lateness is strongly NP-hard

Title of article :

The single machine batching problem with identical family setup times to minimize maximum lateness is strongly NP-hard

Author/Authors :

L.F. Lu، نويسنده , , J.J. Yuan، نويسنده ,

Issue Information :

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

Pages :

From page :

1302

To page :

1309

Keywords :

Scheduling , Maximum lateness , Multi-operation jobs , Batching , Due-dates

Journal title :

European Journal of Operational Research

Serial Year :

2007

Journal title :

European Journal of Operational Research

Record number :

216552

Link To Document :