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

Branch-and-bound algorithm for total weighted tardiness minimization on parallel machines under release dates assumptions

By Kacem Imed   Souayah Nizar   Haouari Mohamed  

RAIRO - Operations Research, Vol. 46, Iss. 2, 2012-07 ,pp. : 125-147

Edp Sciences

Access to resources Recommend Favorite

Hybrid Algorithm Based on an Estimation of Distribution Algorithm and Cuckoo Search for the No Idle Permutation Flow Shop Scheduling Problem with the Total Tardiness Criterion Minimization

By Sun Zewen   Gu Xingsheng  

Sustainability, Vol. 9, Iss. 6, 2017-06 ,pp. : 953-953

MDPI

Access to resources Recommend Favorite

An Improved Algorithm for a Bicriteria Batching Scheduling Problem∗

By He Cheng   Wang Xiumei   Lin Yixun   Mu Yundong  

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

Edp Sciences

Access to resources Recommend Favorite

On Minimizing Total Tardiness in a Serial Batching Problem

By Baptiste Philippe   Jouglet Antoine  

RAIRO - Operations Research, Vol. 35, Iss. 1, 2010-03 ,pp. : 107-115

Edp Sciences

Access to resources Recommend Favorite