Minimizing Weighted Number of Early and Tardy Jobs with a Common Due Window Involving Location Penalty

ISSN： 0254-5330

Source： Annals of Operations Research, Vol.108, Iss.1-4, 2001-11, pp. : 33-54

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

Minimising the weighted number of tardy jobs in a hybrid flow shop with genetic algorithm

By Desprez C.

International Journal of Computer Integrated Manufacturing, Vol. 22, Iss. 8, 2009-08 ,pp. : 745-757

Taylor & Francis Ltd

Access to resources Recommend Favorite

Minimizing the number of late jobs on a single machine under due date uncertainty

By Aissi Hassene

Journal of Scheduling, Vol. 14, Iss. 4, 2011-08 ,pp. : 351-360

Springer Publishing Company

Access to resources Recommend Favorite

An Exact Method to Minimize the Number of Tardy Jobs in Single Machine Scheduling

By Dauzère-Pérès Stéphane Sevaux Marc

Journal of Scheduling, Vol. 7, Iss. 6, 2004-11 ,pp. : 405-420

Springer Publishing Company

Access to resources Recommend Favorite

Single-machine scheduling to minimize maximumtardiness with minimum number of tardy jobs

By Gupta J.N.D. Hariri A.M.A. Potts C.N.

Annals of Operations Research, Vol. 92, Iss. 1, 1999-01 ,pp. : 107-123

Springer Publishing Company

Access to resources Recommend Favorite

Maximizing Weighted number of Just-in-Time Jobs on Unrelated Parallel Machines

By Sung Shao Vlach Milan

Journal of Scheduling, Vol. 8, Iss. 5, 2005-10 ,pp. : 453-460

Springer Publishing Company

Access to resources Recommend Favorite