An Effective Near-Optimal State-Space Search Method: An Application to a Scheduling Problem

ISSN： 0269-2821

Source： Artificial Intelligence Review, Vol.22, Iss.1, 2004-09, pp. : 41-69

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

Near-optimal solution to an employee assignment problem with seniority

By Hojati Mehran

Annals of Operations Research, Vol. 181, Iss. 1, 2010-12 ,pp. : 539-557

Springer Publishing Company

Access to resources Recommend Favorite

A search space analysis of the Job Shop Scheduling Problem

By Mattfeld D.C. Bierwirth C. Kopfer H.

Annals of Operations Research, Vol. 86, Iss. 1, 1999-01 ,pp. : 441-453

Springer Publishing Company

Access to resources Recommend Favorite

Near-optimal, distributed edge colouring via the nibble method

By Dubhashi D. Grable D.A. Panconesi A.

Theoretical Computer Science, Vol. 203, Iss. 2, 1998-08 ,pp. : 225-251

Elsevier

Access to resources Recommend Favorite

Problem space search algorithms for resource-constrained project scheduling

By Naphade K.S. David Wu S. Storer R.H.

Annals of Operations Research, Vol. 70, Iss. 1, 1997-01 ,pp. : 307-326

Springer Publishing Company

Access to resources Recommend Favorite

A scatter search method to minimise makespan of cell scheduling problem

By Saravanan M. Haq A. Noorul

International Journal of Agile Systems and Management, Vol. 3, Iss. 1-2, 2008-07 ,pp. : 18-36

Inderscience Publishers

Access to resources Recommend Favorite