A polynomial-time algorithm for a flow-shop batching problem with equal-length operations

By Brucker Peter  

Journal of Scheduling, Vol. 14, Iss. 4, 2011-08 ,pp. : 371-389

Springer Publishing Company

Access to resources Recommend Favorite

Designing a tabu search algorithm for the two-stage flow shop problem with secondary criterion

By Gupta J. N. D.   Palanimuthu N.   Chen C-L.  

Production Planning and Control, Vol. 10, Iss. 3, 1999-04 ,pp. : 251-265

Taylor & Francis Ltd

Access to resources Recommend Favorite

Scheduling a two-stage hybrid flow shop with parallel machines at the first stage

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

Annals of Operations Research, Vol. 69, Iss. 1, 1997-01 ,pp. : 171-191

Springer Publishing Company

Access to resources Recommend Favorite

Polynomial Algorithms for a Two-Class Multiprocessor Scheduling Problem in Mobile Telecommunications Systems

By Detti Paolo   Agnetis Alessandro   Ciaschetti Gianfranco  

Journal of Scheduling, Vol. 8, Iss. 3, 2005-06 ,pp. : 255-273

Springer Publishing Company

Access to resources Recommend Favorite

An asymptotic fully polynomial time approximation scheme for bin covering

By Jansen K.   Solis-Oba R.  

Theoretical Computer Science, Vol. 306, Iss. 1, 2003-09 ,pp. : 543-551

Elsevier

Access to resources Recommend Favorite