Meta-heuristic approaches for minimizing total earliness and tardiness penalties of single-machine scheduling with a common due date

By Lin Shih-Wei   Chou Shuo-Yan   Chen Shih-Chieh  

Journal of Heuristics, Vol. 13, Iss. 2, 2007-04 ,pp. : 151-165

Springer Publishing Company

Access to resources Recommend Favorite

Branch and Bound Algorithms for Single Machine Scheduling with Batching to Minimize the Number of Late Jobs

By Crauwels H.   Potts C.   Oudheusden D.   Van Wassenhove L.  

Journal of Scheduling, Vol. 8, Iss. 2, 2005-04 ,pp. : 161-177

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

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

By Yeung W.K.   Oğuz C.   Cheng T.C.E.  

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

Springer Publishing Company

Access to resources Recommend Favorite