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

Single-machine batch scheduling problem with job rejection and resource dependent processing times

By Huang Weifan   Wu Chin-Chia   Liu Shangchia  

RAIRO - Operations Research, Vol. 52, Iss. 2, 2018-05 ,pp. : 315-334

Edp Sciences

Access to resources Recommend Favorite

Single-machine past-sequence-dependent setup times scheduling with resource allocation and learning effect

By Zhu Zhanguo   Chu Feng   Yu Yugang   Sun Linyan  

RAIRO - Operations Research, Vol. 50, Iss. 4-5, 2016-11 ,pp. : 733-748

Edp Sciences

Access to resources Recommend Favorite

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

Evaluating flexible solutions in single machine scheduling via objective function maximization: the study of computational complexity

By Aloulou Mohamed Ali   Kovalyov Mikhail Y.   Portmann Marie-Claude  

RAIRO - Operations Research, Vol. 41, Iss. 1, 2007-06 ,pp. : 1-18

Edp Sciences

Access to resources Recommend Favorite