A faster polynomial algorithm for 2-cyclic robotic scheduling

ISSN： 1094-6136

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

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

Abstract

Related content

Cyclic scheduling in robotic flowshops

By Crama Y.

Annals of Operations Research, Vol. 96, Iss. 1-4, 2000-11 ,pp. : 97-124

Springer Publishing Company

Access to resources Recommend Favorite

Parametric algorithms for 2-cyclic robot scheduling with interval processing times

By Kats Vladimir

Journal of Scheduling, Vol. 14, Iss. 3, 2011-06 ,pp. : 267-279

Springer Publishing Company

Access to resources Recommend Favorite

Solving Degenerate Sparse Polynomial Systems Faster

By Rojas J.M.

Journal of Symbolic Computation, Vol. 28, Iss. 1, 1999-07 ,pp. : 155-186

Academic Press

Access to resources Recommend Favorite

Grouping Techniques for Scheduling Problems: Simpler and Faster

By Fishkin Aleksei Jansen Klaus Mastrolilli Monaldo

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

Springer Publishing Company

Access to resources Recommend Favorite

A computationally faster algorithm to test the stability of characteristic polynomials

By Kavitha Panneerselvam Ramakalyan Ayyagari

International Journal of Systems, Control and Communications, Vol. 5, Iss. 2, 2013-08 ,pp. : 166-176

Inderscience Publishers

Access to resources Recommend Favorite