Publisher： Springer Publishing Company
ISSN： 0254-5330
Source： Annals of Operations Research, Vol.92, Iss.1, 1999-01, pp. : 165-183
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
A new lower bound for the list update problem in the partial cost model
By Ambuhl C. Gartner B. von Stengel
Theoretical Computer Science, Vol. 268, Iss. 1, 2001-10 ,pp. :
Access to resources
Recommend
A note on the complexity of the concurrent open shop problem
Journal of Scheduling, Vol. 9, Iss. 4, 2006-08 ,pp. :
Annals of Operations Research, Vol. 110, Iss. 1-4, 2002-02 ,pp. :