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

Author： Gordon Valery S. Werner F. Yanushkevich O. A.

Publisher： Edp Sciences

E-ISSN： 1290-3868|35|1|71-83

ISSN： 0399-0559

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

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

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

Bicriteria scheduling for due date assignment with total weighted tardiness

By Lin Hao He Cheng Lin Yixun

RAIRO - Operations Research, Vol. 52, Iss. 2, 2018-05 ,pp. : 359-370

Edp Sciences

Access to resources Recommend Favorite

Scheduling jobs in open shops with limited machine availability

By Błażewicz Jacek Formanowicz Piotr

RAIRO - Operations Research, Vol. 36, Iss. 2, 2010-03 ,pp. : 149-156

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

A branch and bound algorithm to minimize the single machine maximum tardiness problem under effects of learning and deterioration with setup times

By Duran Toksarı M.

RAIRO - Operations Research, Vol. 50, Iss. 1, 2016-02 ,pp. : 211-219

Edp Sciences

Access to resources Recommend Favorite