A strategy for evolution of algorithms to increase the computational effectiveness of NP-hard scheduling problems

Author： Der-Chiang L. Han-Kun L. Kuan-Yueh T.

Publisher： Elsevier

ISSN： 0377-2217

Source： European Journal of Operational Research, Vol.88, Iss.2, 1996-01, pp. : 404-412

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

Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard

By Hoogeveen J.A. Lenstra J.K. Veltman B.

European Journal of Operational Research, Vol. 89, Iss. 1, 1996-02 ,pp. : 172-175

Elsevier

Access to resources Recommend Favorite

Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems

By Toth P.

European Journal of Operational Research, Vol. 125, Iss. 2, 2000-09 ,pp. : 222-238

Elsevier

Access to resources Recommend Favorite

A knowledge-based evolutionary strategy for scheduling problems with bottlenecks

By Varela R. Vela C.R. Puente J. Gomez A.

European Journal of Operational Research, Vol. 145, Iss. 1, 2003-02 ,pp. : 57-71

Elsevier

Access to resources Recommend Favorite

Using genetic algorithms for single-machine bicriteria scheduling problems

By Koksalan M. Burak Keha A.

European Journal of Operational Research, Vol. 145, Iss. 3, 2003-03 ,pp. : 543-556

Elsevier

Access to resources Recommend Favorite

Sensitivity analysis of scheduling algorithms

By Penz B. Rapine C. Trystram D.

European Journal of Operational Research, Vol. 134, Iss. 3, 2001-11 ,pp. : 606-615

Elsevier

Access to resources Recommend Favorite