Ten notes on equal-processing-time scheduling: At the frontiers of solvability in polynomial time

ISSN： 1619-4500

Source： 4OR: Quarterly journal of the Belgian, French and Italian operations research societies, Vol.2, Iss.2, 2004-07, pp. : 111-127

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

Polynomial-time approximation schemes for scheduling problems with time lags

By Zhang Xiandong Velde Steef

Journal of Scheduling, Vol. 13, Iss. 5, 2010-10 ,pp. : 553-559

Springer Publishing Company

Access to resources Recommend Favorite

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

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

Scheduling Malleable Parallel Tasks: An Asymptotic Fully Polynomial Time Approximation Scheme

By Jansen Klaus

Algorithmica, Vol. 39, Iss. 1, 2004-01 ,pp. : 59-81

Springer Publishing Company

Access to resources Recommend Favorite

Single-machine scheduling problems with time and position dependent processing times

By Zhang Xingong Yan Guangle Huang Wanzhen Tang Guochun

Annals of Operations Research, Vol. 186, Iss. 1, 2011-06 ,pp. : 345-356

Springer Publishing Company

Access to resources Recommend Favorite