

Author: Dayanand N.
Publisher: Springer Publishing Company
ISSN: 0254-5330
Source: Annals of Operations Research, Vol.102, Iss.1-4, 2001-02, pp. : 197-220
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




Depth-first heuristic search for the job shop scheduling problem
Annals of Operations Research, Vol. 206, Iss. 1, 2013-07 ,pp. :



