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

E-ISSN： 1290-3868|47|1|33-46

ISSN： 0399-0559

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

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

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

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

MIP-based heuristics for multi-item capacitated lot-sizing problem with setup times and shortage costs

By Absi Nabil Kedad-Sidhoum Safia

RAIRO - Operations Research, Vol. 41, Iss. 2, 2007-06 ,pp. : 171-192

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

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