Single Machine Preemptive Scheduling to Minimize the Weighted Number of Late Jobs withDeadlines and Nested Release/Due Date Intervals

By Gordon Valery S.   Werner F.   Yanushkevich O. A.  

RAIRO - Operations Research, Vol. 35, Iss. 1, 2010-03 ,pp. : 71-83

Edp Sciences

Access to resources Recommend Favorite

Minimizing the number of tardy jobs for the single machine scheduling problem: MIP-based lower and upper bounds

By Briand Cyril   Ourari Samia  

RAIRO - Operations Research, Vol. 47, Iss. 1, 2013-02 ,pp. : 33-46

Edp Sciences

Access to resources Recommend Favorite

Scheduling with periodic availability constraints and irregular cost functions

By Sourd Francis  

RAIRO - Operations Research, Vol. 41, Iss. 2, 2007-06 ,pp. : 141-154

Edp Sciences

Access to resources Recommend Favorite

Parallel Machine Scheduling with Uncertain Communication Delays

By Moukrim Aziz   Sanlaville Eric   Guinand Frédéric  

RAIRO - Operations Research, Vol. 37, Iss. 1, 2010-03 ,pp. : 1-16

Edp Sciences

Access to resources Recommend Favorite

An efficient ILP formulation for the single machine scheduling problem

By Briand Cyril   Ourari Samia   Bouzouia Brahim  

RAIRO - Operations Research, Vol. 44, Iss. 1, 2010-02 ,pp. : 61-71

Edp Sciences

Access to resources Recommend Favorite