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

ISSN： 1094-6136

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

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

On polynomial-time approximation algorithms for the variable length scheduling problem

By Czumaj A. Gasieniec L. Gaur D.R. Krishnamurti R. Rytter W. Zito M.

Theoretical Computer Science, Vol. 302, Iss. 1, 2003-06 ,pp. : 489-495

Elsevier

Access to resources Recommend Favorite

A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem

By Schuurman P. Woeginger G.J.

Theoretical Computer Science, Vol. 237, Iss. 1, 2000-04 ,pp. : 105-122

Elsevier

Access to resources Recommend Favorite

An Ant Colony System Algorithm for the Hybrid Flow-Shop Scheduling Problem

International Journal of Applied Metaheuristic Computing (IJAMC), Vol. 2, Iss. 1, 2011-01 ,pp. : 29-43

IGI Global_journal

Access to resources Recommend Favorite

A polynomial-time algorithm for checking equivalence under certain semiring congruences motivated by the state-space isomorphism problem for hybrid systems

By DasGupta

Theoretical Computer Science, Vol. 262, Iss. 1, 2001-07 ,pp. : 161-189

Elsevier

Access to resources Recommend Favorite

A Polynomial-Time Algorithm for Memory Space Reduction

By Song Yonghong Wang Cheng Li Zhiyuan

International Journal of Parallel Programming, Vol. 33, Iss. 1, 2005-02 ,pp. : 1-33

Springer Publishing Company

Access to resources Recommend Favorite