Shortest consistent superstrings computable in polynomial time

By Jiang T.   Timkovsky V.G.  

Theoretical Computer Science, Vol. 143, Iss. 1, 1995-07 ,pp. : 113-122

Elsevier

Access to resources Recommend Favorite

A single machine scheduling problem with common due window and controllable processing times

By Liman S.D.   Panwalkar S.S.   Thongmee S.  

Annals of Operations Research, Vol. 70, Iss. 1, 1997-01 ,pp. : 145-154

Springer Publishing Company

Access to resources Recommend Favorite

On the approximation of longest common nonsupersequences and shortest common nonsubsequences

By Zhang L.  

Theoretical Computer Science, Vol. 143, Iss. 2, 1995-06 ,pp. : 353-362

Elsevier

Access to resources Recommend Favorite

Scheduling of coupled tasks with unit processing times

By Blazewicz J.   Ecker K.   Kis T.   Potts C.   Tanas M.   Whitehead J.  

Journal of Scheduling, Vol. 13, Iss. 5, 2010-10 ,pp. : 453-461

Springer Publishing Company

Access to resources Recommend Favorite

Lot-sizing scheduling with batch setup times

By Chen Bo   Ye Yinyu   Zhang Jiawei  

Journal of Scheduling, Vol. 9, Iss. 3, 2006-06 ,pp. : 299-310

Springer Publishing Company

Access to resources Recommend Favorite