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

Single machine scheduling with maximum earliness and number tardy

By Azizoglu M.   Kondakci S.   Koksalan M.  

Computers and Industrial Engineering, Vol. 45, Iss. 2, 2003-08 ,pp. : 257-268

Elsevier

Access to resources Recommend Favorite

One-machine scheduling to minimize mean tardiness with minimum number tardy

By Duffuaa S. O.   Raouf A.   Ben-Daya M.   Makki M.  

Production Planning and Control, Vol. 8, Iss. 3, 1997-04 ,pp. : 226-230

Taylor & Francis Ltd

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

Single machine bicriteria scheduling with equal-length jobs to minimize total weighted completion time and maximum cost

By He Cheng   Lin Hao   Wang Xiumei  

4OR: Quarterly journal of the Belgian, French and Italian operations research societies, Vol. 12, Iss. 1, 2014-03 ,pp. : 87-93

Springer Publishing Company

Access to resources Recommend Favorite