Grouping Techniques for Scheduling Problems: Simpler and Faster

Author： Fishkin Aleksei Jansen Klaus Mastrolilli Monaldo

ISSN： 0178-4617

Source： Algorithmica, Vol.51, Iss.2, 2008-06, pp. : 183-199

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

Mass production of DVDs: faster, more complex but cheaper and simpler

By Binkowska P. Cord B. Wohlfart P.

Microsystem Technologies, Vol. 13, Iss. 2, 2007-01 ,pp. : 139-144

Springer Publishing Company

Access to resources Recommend Favorite

Faster Ranking Using Extrapolation Techniques

International Journal of Computer Vision and Image Processing (IJCVIP), Vol. 1, Iss. 3, 2011-07 ,pp. : 35-52

IGI Global_journal

Access to resources Recommend Favorite

Faster Algorithms for Stable Allocation Problems

By Dean Brian Munshi Siddharth

Algorithmica, Vol. 58, Iss. 1, 2010-09 ,pp. : 59-81

Springer Publishing Company

Access to resources Recommend Favorite

A faster polynomial algorithm for 2-cyclic robotic scheduling

By Chu Chengbin

Journal of Scheduling, Vol. 9, Iss. 5, 2006-10 ,pp. : 453-468

Springer Publishing Company

Access to resources Recommend Favorite

Faster exact solutions for some NP-hard problems

By Drori L. Peleg D.

Theoretical Computer Science, Vol. 287, Iss. 2, 2002-09 ,pp. : 473-499

Elsevier

Access to resources Recommend Favorite