Local search heuristics for single machine scheduling with batch set-up times to minimize total weighted completion time

By Crauwels H.A.J.   Potts C.N.   van Wassenhove L.N.  

Annals of Operations Research, Vol. 70, Iss. 1, 1997-01 ,pp. : 261-279

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

Lower bounds for on-line single-machine scheduling

By Epstein L.   van Stee R.  

Theoretical Computer Science, Vol. 299, Iss. 1, 2003-04 ,pp. : 439-450

Elsevier

Access to resources Recommend Favorite

Rolling horizon procedures for the single machine deterministic total completion time scheduling problem with release dates

By Chand S.   Traub R.   Uzsoy R.  

Annals of Operations Research, Vol. 70, Iss. 1, 1997-01 ,pp. : 115-125

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